Preparing NOJ

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.

The first line of the input contains integer number *n* (1 ≤ *n* ≤ 10^{5}), 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 10^{6} .

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

2

R23C55

BC23

BC23

R23C55

Info

Provider CodeForces

Origin Codeforces Beta Round #1

Code CF1B

Tags

implementationmath

Submitted 23

Passed 7

AC Rate 30.43%

Date 03/03/2019 19:34:44

Related