CF1557E.Assiut Chess

This is an interactive problem.

ICPC Assiut Community decided to hold a unique chess contest, and you were chosen to control a queen and hunt down the hidden king, while a member of ICPC Assiut Community controls this king.

You compete on an $8\times8$ chessboard, the rows are numerated from top to bottom, and the columns are numerated left to right, and the cell in row $x$ and column $y$ is denoted as $(x, y)$.

In one turn you can move the queen to any of the squares on the same horizontal line, vertical line, or any of the diagonals. For example, if the queen was on square ($4$, $5$), you can move to ($q_1$, $5$), ($4$, $q_1$), ($q_1$, $9-q_1$), or ($q_2$, $q_2+1$) where ($1 \le q_1 \le 8$, $q_1 \ne 4$, $1 \le q_2 \le 7$, $q_2 \ne 4$). Note that the queen cannot stay on its current cell.

In one turn, the king can move "Right", "Left", "Up", "Down", "Down-Right", "Down-Left", "Up-Left", or "Up-Right" such that he doesn't get out of the board. The king cannot move into a cell that is on the same row, column or diagonal with the queen (including the position of the queen itself). For example, if the king was on square ($4$, $5$), he can move to ($4+k_1$, $5+k_2$) where ($-1 \le k_1,k_2 \le 1$, $(k_1, k_2) \ne (0, 0)$).

At the start of the game, you should place the queen at any location on the board, and this is done once per game. After that the king is secretly placed at any cell different from the queen's location. You do not know the position of the king. Then, the king and the queen take turns with the king moving first. The king moves to one of the possible directions ("Right", "Down", "Up-Left", etc.), and you are only given the direction it moves to. After that, you should move your queen by declaring the square to which your queen will move. The game follows like this until you win the game or run out of moves.

You win if the king has no valid moves. You lose if after $130$ moves of the queen the king still has valid moves.

这是一个交互式问题。

ICPC 阿斯尤特社区决定举办一场独特的国际象棋比赛，你将操控一枚皇后（Queen）来追捕隐藏的国王（King），而一名 ICPC 阿斯尤特社区成员则操控该国王。

你们在一块 $8\times8$ 的棋盘上进行对弈：行从上到下编号，列从左到右编号；位于第 $x$ 行、第 $y$ 列的格子记作 $(x, y)$。

每回合，你可以将皇后移动至同一水平线、同一竖直线或任意一条对角线上的任意一个格子。例如，若皇后位于格子 $(4, 5)$，则你可以将其移至 $(q_1, 5)$、$(4, q_1)$、$(q_1, 9-q_1)$ 或 $(q_2, q_2+1)$，其中 $1 \le q_1 \le 8$、$q_1 \ne 4$、$1 \le q_2 \le 7$、$q_2 \ne 4$。注意：皇后不能停留在当前格子。

每回合，国王可向“右”、“左”、“上”、“下”、“右下”、“左下”、“左上”或“右上”方向移动一格，但不得移出棋盘边界；且国王不能移动至与皇后处于同一行、同一列或同一条对角线上的格子（包括皇后所在格子本身）。例如，若国王位于格子 $(4, 5)$，则它可移至 $(4+k_1, 5+k_2)$，其中 $-1 \le k_1,k_2 \le 1$，且 $(k_1, k_2) \ne (0, 0)$。

游戏开始时，你须将皇后置于棋盘上任意一个位置，此操作每局仅执行一次。随后，国王被秘密放置于棋盘上除皇后所在格子外的任一格子中；你无法得知国王的具体位置。接着，国王与皇后轮流行动，国王先行。国王朝某个合法方向（如“右”、“下”、“左上”等）移动一格，你仅获知其移动方向；之后，你需声明皇后将要移动至的目标格子。如此循环往复，直至你获胜或用尽所有步数。

若国王无合法移动，则你获胜；若在皇后完成 $130$ 步移动后，国王仍有合法移动，则你失败。

The first line contains a single integer $t$ ($1 \le t \le 60$) — the number of test cases.

第一行包含一个整数 $t$（$1 \le t \le 60$）—— 测试用例的数量。

In the example, the hidden king was at $(8, 8)$ at the start. The game follows like this:

在示例中，隐藏的国王初始位置为 $(8, 8)$。游戏过程如下：