CF1915B.Not Quite Latin Square

传统题 时间 2000 ms 内存 256 MiB 3 尝试 1 已通过 1 标签

Not Quite Latin Square

A Latin square is a 3×33 \times 3 grid made up of the letters A, B, and C such that:

  • in each row, the letters A, B, and C each appear once, and
  • in each column, the letters A, B, and C each appear once.

For example, one possible Latin square is shown below. $$\begin{bmatrix} \texttt{A} & \texttt{B} & \texttt{C} \ \texttt{C} & \texttt{A} & \texttt{B} \ \texttt{B} & \texttt{C} & \texttt{A} \ \end{bmatrix}$$

You are given a Latin square, but one of the letters was replaced with a question mark?\texttt{?}. Find the letter that was replaced.

Input

The first line of the input contains a single integer tt (1t1081 \leq t \leq 108) — the number of testcases.

Each test case contains three lines, each consisting of three characters, representing the Latin square. Each character is one of A, B, C, or ?.

Each test case is a Latin square with exactly one of the letters replaced with a question mark ?.

Output

For each test case, output the letter that was replaced.

Note

The correct Latin squares for the three test cases are shown below:

$$$\begin{bmatrix} \texttt{A} & \texttt{B} & \texttt{C} \\ \texttt{C} & \color{red}{\texttt{A}} & \texttt{B} \\ \texttt{B} & \texttt{C} & \texttt{A} \\ \end{bmatrix} \quad \begin{bmatrix} \texttt{B} & \texttt{C} & \texttt{A} \\ \texttt{C} & \texttt{A} & \color{red}{\texttt{B}} \\ \texttt{A} & \texttt{B} & \texttt{C} \\ \end{bmatrix} \quad \begin{bmatrix} \color{red}{\texttt{C}} & \texttt{A} & \texttt{B} \\ \texttt{B} & \texttt{C} & \texttt{A} \\ \texttt{A} & \texttt{B} & \texttt{C} \\ \end{bmatrix}$$$

Samples

3
ABC
C?B
BCA
BCA
CA?
ABC
?AB
BCA
ABC
A
B
C

在线编程 IDE

建议全屏模式获得最佳体验