CF1907A.Rook

As you probably know, chess is a game that is played on a board with 64 squares arranged in an $8\times 8$ grid. Columns of this board are labeled with letters from a to h, and rows are labeled with digits from 1 to 8. Each square is described by the row and column it belongs to.

The rook is a piece in the game of chess. During its turn, it may move any non-zero number of squares horizontally or vertically. Your task is to find all possible moves for a rook on an empty chessboard.

你可能知道，国际象棋是在一个由 64 个方格组成的 $8\times 8$ 棋盘上进行的游戏。该棋盘的列用字母 a 到 h 标记，行用数字 1 到 8 标记。每个方格由其所处的行和列共同描述。

车（Rook）是国际象棋中的一种棋子。在它的回合中，它可以沿水平或垂直方向移动任意非零数量的格子。你的任务是找出空棋盘上一个车的所有可能走法。

The first line of input contains single integer $t$ ($1 \le t \le 64$) — the number of test cases. The descriptions of test cases follow.

Each test case contains one string of two characters, description of the square where rook is positioned. The first character is a letter from a to h, the label of column, and the second character is a digit from 1 to 8, the label of row.

The same position may occur in more than one test case.

输入的第一行包含一个整数 $t$（$1 \le t \le 64$），表示测试用例的数量。随后是各测试用例的描述。

每个测试用例包含一个长度为二的字符串，表示车（rook）所在方格的位置。该字符串的第一个字符是字母 a 到 h 中的一个，表示列标；第二个字符是数字 1 到 8 中的一个，表示行标。

同一位置可能在多个测试用例中出现。

For each test case, output descriptions of all squares where the rook can move, in the same format as in the input.

You can output squares in any order per test case.

对于每个测试用例，以与输入中相同的格式输出车（rook）可以移动到的所有方格的描述。

每个测试用例中，方格的输出顺序可以任意。