CF_1B_Spreadsheets

B. Spreadsheets

time limit per test

10 seconds

memory limit per test

64 megabytes

input

standard input

output

standard output

In the popular spreadsheets systems (for example, in Excel) the following numeration of columns is used. The first column has number A, the second — number B, etc. till column 26 that is marked by Z. Then there are two-letter numbers: column 27 has number AA, 28 — AB, column 52 is marked by AZ. After ZZ there follow three-letter numbers, etc.

The rows are marked by integer numbers starting with 1. The cell name is the concatenation of the column and the row numbers. For example, BC23 is the name for the cell that is in column 55, row 23.

Sometimes another numeration system is used: RXCY, where X and Y are integer numbers, showing the column and the row numbers respectfully. For instance, R23C55 is the cell from the previous example.

Your task is to write a program that reads the given sequence of cell coordinates and produce each item written according to the rules of another numeration system.

Input

The first line of the input contains integer number n (1 ≤ n ≤ 105), the number of coordinates in the test. Then there follow n lines, each of them contains coordinates. All the coordinates are correct, there are no cells with the column and/or the row numbers larger than 106.

Output

Write n lines, each line should contain a cell coordinates in the other numeration system.

Examples

input

2
R23C55
BC23

output

BC23
R23C55

题意有两种标记行列的方式

行号都是一致的其实就是列号的转化

但是要注意这个跟26进制是有一点区别的

#include <iostream>
#include <stdio.h>
using namespace std;

const int M=100;
char s[M];
char ss[M];


int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s",s);
        int num1=0,num2=0;
        if(s[0]=='R')
        {
            int i=1;
            while('0'<=s[i]&&s[i]<='9')
                num1=num1*10+s[i++]-'0';
            if(i>1&&s[i]=='C')
            {
                i++;
                while('0'<=s[i]&&s[i]<='9')
                    num2=num2*10+s[i++]-'0';
                //cout<<num2<<endl;
                int j=0;//,f=0;
                while(num2>0)
                {
                    ss[++j]=(num2-1)%26+'A';//可能出现最顶部出现1
                    //cout<<num2<<" "<<ss[j]<<endl;
                    if(num2%26==0)
                        num2=num2/26-1;//,f=1;
                    else
                        num2/=26;//,f=0;

                }
                //cout<<j<<endl;
                for(;j>=1;j--)
                    if('A'<=ss[j]&&ss[j]<='Z')
                    printf("%c",ss[j]);
                printf("%d\n",num1);
                continue;
            }
        }
        int i=0;
        num1=0,num2=0;
        while('A'<=s[i]&&s[i]<='Z')
            num2=num2*26+s[i++]-'A'+1;
        while('0'<=s[i]&&s[i]<='9')
            num1=num1*10+s[i++]-'0';
        printf("R%dC%d\n",num1,num2);
    }
    return 0;
}