1468_K. 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.

Input

The first line contains one integer t (1 ≤ t ≤ 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.

Output

For each test case print a single line:

  * if there is a solution, print two integers x and y (-10^9 ≤ x,y ≤ 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.

Example

Input


4
L
RUUDL
LLUU
DDDUUUUU


Output


-1 0
1 2
0 0
0 1
```python
#region Header
#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq

def input():
    return sys.stdin.readline()[:-1]

# sys.setrecursionlimit(1000000)
#endregion

# _INPUT = """# paste here...
# """
# sys.stdin = io.StringIO(_INPUT)



def solve(S):
    Move = {'L': (-1, 0), 'R': (1, 0), 'U': (0, 1), 'D': (0, -1)}
    Moves = [Move[c] for c in S]
    pos1 = (0, 0)
    for k in range(len(S)):
        pos1 = (pos1[0] + Moves[k][0], pos1[1] + Moves[k][1])
        block = pos1
        pos = (0, 0)
        for i in range(len(S)):
            pos_next = (pos[0] + Moves[i][0], pos[1] + Moves[i][1])
            if pos_next != block:
                pos = pos_next
        if pos == (0, 0):
            return block
    return (0, 0)

def main():
    T0 = int(input())
    for _ in range(T0):
        S = input()
        ans = solve(S)
        print(*ans)

if __name__ == '__main__':
    main()

```