write a go solution for Description:
You are given a room that can be represented by a nxm grid. There is a ball at position (i_1,j_1) (the intersection of row i_1 and column j_1), and it starts going diagonally in one of the four directions:

- The ball is going down and right, denoted by textttDR; it means that after a step, the ball's location goes from (i,j) to (i+1,j+1).
- The ball is going down and left, denoted by textttDL; it means that after a step, the ball's location goes from (i,j) to (i+1,j-1).
- The ball is going up and right, denoted by textttUR; it means that after a step, the ball's location goes from (i,j) to (i-1,j+1).
- The ball is going up and left, denoted by textttUL; it means that after a step, the ball's location goes from (i,j) to (i-1,j-1).

After each step, the ball maintains its direction unless it hits a wall (that is, the direction takes it out of the room's bounds in the next step). In this case, the ball's direction gets flipped along the axis of the wall; if the ball hits a corner, both directions get flipped. Any instance of this is called a bounce. The ball never stops moving.

In the above example, the ball starts at (1,7) and goes textttDL until it reaches the bottom wall, then it bounces and continues in the direction textttUL. After reaching the left wall, the ball bounces and continues to go in the direction textttUR. When the ball reaches the upper wall, it bounces and continues in the direction textttDR. After reaching the bottom-right corner, it bounces once and continues in direction textttUL, and so on.

Your task is to find how many bounces the ball will go through until it reaches cell (i_2,j_2) in the room, or report that it never reaches cell (i_2,j_2) by printing -1.

Note that the ball first goes in a cell and only after that bounces if it needs to.

Input Format:
The first line contains a single integer t (1<=t<=1000) — the number of test cases.

The first line of each test case contains six integers and a string n,m,i_1,j_1,i_2,j_2,d (2<=n,m<=25000; 1<=i_1,i_2<=n; 1<=qj_1,j_2<=qm; dintextttDR,textttDL,textttUR,textttUL) — the dimensions of the grid, the starting coordinates of the ball, the coordinates of the final cell and the starting direction of the ball.

It is guaranteed that the sum of n*m over all test cases does not exceed 5*10^4.

Output Format:
For each test case, output a single integer — the number of bounces the ball does until it reaches cell (i_2,j_2) for the first time, or -1 if the ball never reaches the final cell.

Note:
None. Output only the code with no comments, explanation, or additional text.