CF1468K.The Robot

There is a robot on a checkered field that is endless in all directions. Initially, the robot is located in the cell with coordinates $(0, 0)$. He will execute commands which are described by a string of capital Latin letters 'L', 'R', 'D', 'U'. When a command is executed, the robot simply moves in the corresponding direction:

• 'L': one cell to the left (the $x$-coordinate of the current cell decreases by $1$);
• 'R': one cell to the right (the $x$-coordinate of the current cell is increased by $1$);
• 'D': one cell down (the $y$-coordinate of the current cell decreases by $1$);
• 'U': one cell up (the $y$-coordinate of the current cell is increased by $1$).

Your task is to put an obstacle in one cell of the field so that after executing the commands, the robot will return to the original cell of its path $(0, 0)$. Of course, an obstacle cannot be placed in the starting cell $(0, 0)$. It is guaranteed that if the obstacle is not placed, then the robot will not return to the starting cell.

An obstacle affects the movement of the robot in the following way: if it tries to go in a certain direction, and there is an obstacle, then it simply remains in place (the obstacle also remains, that is, it does not disappear).

Find any such cell of the field (other than $(0, 0)$) that if you put an obstacle there, the robot will return to the cell $(0, 0)$ after the execution of all commands. If there is no solution, then report it.

有一个机器人位于一个在所有方向上无限延伸的方格场上。初始时，机器人位于坐标为 $(0, 0)$ 的格子中。它将执行由大写拉丁字母 'L'、'R'、'D'、'U' 组成的字符串所描述的指令。执行每条指令时，机器人会简单地向对应方向移动一格：

• 'L'：向左移动一格（当前格子的 $x$ 坐标减 $1$）；
• 'R'：向右移动一格（当前格子的 $x$ 坐标加 $1$）；
• 'D'：向下移动一格（当前格子的 $y$ 坐标减 $1$）；
• 'U'：向上移动一格（当前格子的 $y$ 坐标加 $1$）。

你的任务是在场上的某个格子中放置一个障碍物，使得机器人执行完全部指令后，能够回到其路径的起始格子 $(0, 0)$。当然，障碍物不能放置在起始格子 $(0, 0)$ 中。题目保证：若不放置障碍物，则机器人执行完全部指令后不会回到起始格子。

障碍物对机器人的运动影响如下：若机器人试图朝某一方向移动，而该方向的相邻格子中存在障碍物，则它将停留在原地不动（障碍物也保持不动，即不会消失）。

请找出任意一个满足条件的格子（除 $(0, 0)$ 外），使得在该格子放置障碍物后，机器人执行完全部指令将回到格子 $(0, 0)$。若不存在这样的格子，请报告无解。

The first line contains one integer $t$ ($1 \le t \le 500$) — the number of test cases.

Each test case consists of a single line containing $s$ — the sequence of commands, which are uppercase Latin letters 'L', 'R', 'D', 'U' only. The length of $s$ is between $1$ and $5000$, inclusive. Additional constraint on $s$: executing this sequence of commands leads the robot to some cell other than $(0, 0)$, if there are no obstacles.

The sum of lengths of all $s$ in a test doesn't exceed $5000$.

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

每个测试用例由一行组成，包含字符串 $s$ —— 一串命令序列，其中每个命令仅为大写拉丁字母 'L'、'R'、'D' 或 'U'。字符串 $s$ 的长度在 $1$ 到 $5000$ 之间（含端点）。关于 $s$ 的额外约束：若无障碍物，执行该命令序列将使机器人到达除 $(0, 0)$ 外的某个格子。

所有测试用例中 $s$ 的长度总和不超过 $5000$。

For each test case print a single line:

• if there is a solution, print two integers $x$ and $y$ ($-10^9 \le x,y \le 10^9$) such that an obstacle in $(x, y)$ will force the robot to return back to the cell $(0, 0)$;
• otherwise, print two zeroes (i. e. 0 0).

If there are multiple answers, you can print any of them.

对每个测试用例，输出一行：

• 如果存在解，则输出两个整数 $x$ 和 $y$（满足 $-10^9 \le x,y \le 10^9$），使得在坐标 $(x, y)$ 处放置一个障碍物可迫使机器人返回起点 $(0, 0)$；
• 否则，输出两个零（即 0 0）。

若存在多个答案，输出任意一个即可。