#include <cstdio>
#include <cstring>
#include <string>
#include <math.h>
using namespace std;const int N = 100010;
char s[N];
int L[N],R[N];
int lr;
int calnum(int x,int y)
{if (x > y)  return -1;int res = 0;bool flag = false;for (int i = x; i <= y; i ++){if (flag)if (s[i] < '0' || s[i] > '9'){R[lr ++] = i - 1;res += calnum(i,y);return res;}else;else if (s[i] >= '0' && s[i] <= '9'){res ++;L[lr] = i;flag = true;}}R[lr ++] = y;return res;
}
int cal1(int l,int r)
{int res = 0;int base = 1;for (int i = r; i >= l; i --){res += (s[i] - 'A' + 1) * base;base *= 26;}return res;
}
int cal2(int l,int r)
{int res = 0;for (int i = l; i <= r; i ++)res = res * 10 + s[i] - '0';return res;
}
void work1()
{int col = cal1(0,L[0] - 1);int row = cal2(L[0], R[0]);printf("R%dC%d\n",row,col);
}
int ff(char a[], int x, int n)
{int pos = 0;while(n){n --;a[pos ++] = n % 26 + 'A';n /= 26;}return pos - 1;
}
void work2()
{int row,col;if (s[L[0] - 1] == 'R')row = cal2(L[0],R[0]),col = cal2(L[1],R[1]);else{col = cal2(L[0],R[0]);row = cal2(L[1],R[1]);}char a[5];memset(a,0,sizeof(a));int pos = ff(a,0,col);for (int i = pos; i >= 0; i --)putchar(a[i]);printf("%d\n",row);
}
int main()
{//freopen("0test.in","r+",stdin);int n ;scanf("%d",&n);while(n --){lr = 0;scanf("%s",s);int k = calnum(0,strlen(s) - 1);if (k == -1)    return 0;if (k == 1)work1();else    work2();}return 0;
}

#include <iostream>
#include <cstdio>
#include <string>
#include <map>
#include <cstring>
using namespace std;map <string ,int > m1,m2;
int score[1010];
string s[1010];
int main()
{int maxscore = 0;int n;cin>>n;m1.clear();m2.clear();for (int i = 0; i < n; i ++){cin>>s[i];cin>>score[i];m1[s[i]] += score[i];}map<string, int>::iterator it;for (it = m1.begin(); it != m1.end(); it ++)if (it->second > maxscore)maxscore = it->second;for (int i = 0; i < n; i ++){m2[s[i]] += score[i];if (m1[s[i]] == maxscore && m2[s[i]] >= maxscore){cout<<s[i]<<endl;return 0;}}return 0;
}

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;struct mm
{int p;int id;
}a1[100010],a2[100010];
int n1,n2;
bool cmp(mm a, mm b)
{return a.p > b.p;
}
int n,v;
int w1[100010];
int main()
{scanf("%d%d",&n,&v);for (int i = 0; i < n; i ++){int w,p;scanf("%d%d",&w,&p);if (w == 1){a1[n1].p = p;a1[n1 ++].id = i + 1;}else{a2[n2]. p = p;a2[n2 ++].id = i + 1;}}sort(a1,a1+n1,cmp);sort(a2,a2+n2,cmp);w1[0] = 0;for (int i = 1; i <= n1; i ++)w1[i] = w1[i - 1] + a1[i - 1].p;int sum = 0;int res = 0;int y1 = 0,y2 = 0;for (int i = -1; i < min(v/2, n2); i ++){if (i != -1)sum += a2[i].p;int q = v - (i + 1) * 2;if (q <= n1)if (res < sum + w1[q]){res = sum + w1[q];y1 = q;y2 = i + 1;}else;else if (res < sum + w1[n1]){res = sum + w1[n1];y1 = n1;y2 = i + 1;}}printf("%d\n",res);if (y1 + y2 > 0){for (int i = 0; i < y1; i ++)printf("%d ",a1[i].id);for (int i = 0; i < y2; i ++)printf("%d ",a2[i].id);printf("\n");}return 0;
}

#include <cstdio>
#include <cstring>
using namespace std;int x,o,p;
char s[5][5];
int main()
{for (int i = 0; i < 3; i ++){char ss[5];gets(ss);for (int j = 0; j < 3; j ++){s[i][j] = ss[j];if (ss[j] == 'X')x ++;else if (ss[j] == '0')   o ++;else p ++;}}if (x - o > 1 || o - x > 0)printf("illegal\n");else{int xx = 0,oo = 0;for (int i = 0; i < 3; i ++){int a = 0,b = 0;for (int j = 0; j < 3; j ++){if (s[i][j] == 'X') a ++;else if (s[i][j] == '0')   b ++;}if (a == 3)     xx = 3;if (b == 3)     oo = 3;}for (int j = 0; j < 3; j ++){int a = 0,b = 0;for (int i = 0; i < 3; i ++){if (s[i][j] == 'X') a ++;else if (s[i][j] == '0')   b ++;}if (a == 3)     xx = 3;if (b == 3)     oo = 3;}int a = 0, b = 0;for (int i = 0; i < 3; i ++)if (s[i][2-i] == 'X')   a ++;else if (s[i][2-i] == '0')  b ++;if (a == 3)     xx = 3;if (b == 3)     oo = 3;a = 0;  b = 0;for (int i = 0; i < 3; i ++)if (s[i][i] == 'X')     a ++;else if (s[i][i] == '0')    b ++;if (a == 3)     xx = 3;if (b == 3)     oo = 3;if (xx == 3 && oo == 3)   {   printf("illegal\n");    return 0;}else if (xx == 3){if (x == o) {printf("illegal\n");   return 0;}else printf("the first player won\n");  return 0;}else if (oo == 3){if (x > o)  {   printf("illegal\n");    return 0; }else    printf("the second player won\n"); return 0;}if (p == 0) {   printf("draw\n");   return 0;}if (x > o)  {   printf("second\n"); return 0;}if (o == x)  {   printf("first\n");  return 0;}}return 0;
}

#include <iostream>
#include <cstring>
using namespace std;int main()
{int mint[40],maxt[40];int a[40];int d,sum;cin>>d>>sum;memset(mint,0,sizeof(mint));memset(maxt,0,sizeof(maxt));for (int i = 0; i < d; i ++)cin>>mint[i]>>maxt[i];for (int i = 0; i < d; i ++){a[i] = mint[i];sum -= mint[i];}if (sum < 0)    cout<<"NO\n";else{for (int i = 0; i < d; i ++){if (sum <= 0)break;if (sum < maxt[i] - mint[i]){a[i] += sum;sum = 0;}else{a[i] = maxt[i];sum -= maxt[i] - mint[i];}}if (sum > 0)    cout<<"NO\n";else{cout<<"YES\n";for (int i = 0; i < d - 1; i ++)cout<<a[i]<<" ";cout<<a[d-1]<<endl;}}return 0;
}

#include <iostream>
#include <string>
#include <cstring>
#include <map>
#include <cmath>
using namespace std;#define eps 1e-1
map <string ,int> m;
char a[100010];
void ff(char a[], int x)
{double l = log(double(x + eps))/log(double(10));int p = l;while(x){a[p--] = x % 10 + '0';x /= 10;}
}
int main()
{m.clear();string s;int n;cin>>n;while(n--){cin>>s;if (m[s] == 0){m[s] ++;cout<<"OK\n";}else{memset(a,0,sizeof(a));int p = m[s];ff(a,p);m[s] ++;s = s + string(a);cout<<s<<endl;}}return 0;
}

#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;struct envelop
{int w,h;int id;
}e[5005];
bool cmp(envelop a, envelop b)
{if (a.w != b.w)return a.w > b.w;elsereturn a.h > b.h;
}
int main()
{int f[5005];int pre[5005];memset(pre,-1,sizeof(pre));int n,w,h;cin>>n>>w>>h;for (int i = 0; i < n; i ++){cin>>e[i].w>>e[i].h;e[i].id = i + 1;}sort(e,e+n,cmp);for (int i = 0; i < n; i ++)f[i] = 1;for (int i = 1; i < n; i ++)for (int j = 0; j < i; j ++)if (e[j].w > e[i].w && e[j].h > e[i].h && f[j] + 1 > f[i]){pre[i] = j;f[i] = f[j] + 1;}int k = -1;int maxn = 0;for (int i = 0; i < n; i ++)if (f[i] > maxn && e[i].w > w && e[i].h > h){k = i;maxn = f[i];}if (k == -1){cout<<0<<endl;return 0;}cout<<maxn<<endl;int a[5005];int p = pre[k];a[0] = e[k].id;int num = 1;while(p != -1){a[num ++] = e[p].id;p = pre[p];}for (int i = 0; i < maxn - 1; i ++)cout<<a[i]<<" ";cout<<a[maxn - 1]<<endl;return 0;
}

#include <iostream>
#include <stack>
#include <cstring>
using namespace std;stack <pair<char,int> > t;
int main()
{int maxn = 0,maxnum = 1;int n = 0;string s;cin>>s;for (int i = 0; i < s.size(); i ++){if (s[i] == '('){t.push(make_pair(s[i], n));n = 0;}else{if (t.empty())n = 0;else{int u = t.top().second;t.pop();n += u + 2;if (n > maxn){maxn = n;maxnum = 1;}else if (n != 0 && n == maxn)maxnum ++;}}}cout<<maxn<<" "<<maxnum<<endl;
}

#include <iostream>
#include <cstring>
using namespace std;const int N = 1000100;
long long l[N],r[N],a[N],b[N],c[N];
int main(){int n;cin>>n;for (int i = 0; i < n; i ++){cin>>b[i];}int max = 0,maxn = 0;for (int i = 0; i < n; i ++){if (b[i] > max){max = b[i];maxn = i;}}int j = 0;for (int i = maxn + 1; i < n; i ++){a[j ++] = b[i];}for (int i = 0; i <= maxn; i ++){a[j ++] = b[i];}memset(l,-1,sizeof(l));memset(r,-1,sizeof(r));memset(c,0,sizeof(c));for (int i = n - 2; i >= 0; i --){int p = i + 1;while(p != -1 && p != i && a[p] <= a[i]){if (p != i && a[p] == a[i]){c[i] = c[p] + 1;}p = r[p];}if (p != i && a[p] > a[i]) r[i] = p;}if (a[0] < a[n-1])    l[0] = n - 1;for (int i = 1; i < n; i ++){int p = i - 1;while(p != -1 && p != i && a[p] <= a[i]){p = l[p];}if (p != i && a[p] > a[i]){l[i] = p;}}long long ans = 0;for (int i = 0; i < n; i ++){ans += c[i];if (l[i] == -1 || r[i] == -1){if (l[i] == -1 && r[i] == -1)continue;else    ans ++;}else if (l[i] == n - 1 && r[i] == n - 1)ans ++;elseans += 2;}cout<<ans<<endl;return 0;
}