Table Split

A table has $n$ rows and $m$ columns. The cells are filled row by row with the numbers from 1 to $n \cdot m$. In other words, cell $(r, c)$ contains $(r - 1) \cdot m + c$.

The figure below shows such a table for $n = 3$, $m = 5$.

Split the table with one vertical or horizontal cut along the cell sides, so that the sums of the numbers in the two parts differ as little as possible. In this problem, one test contains several queries, and you must find the optimal cut for each one.

The first line contains the number of queries $t$ ($1 \le t \le 10^5$). Each of the next $t$ lines contains two integers $n$ and $m$ ($1 \le n, m \le 10^9$, $2 \le n \times m \le 10^9$).

Print $t$ lines, one answer per line. Each answer has the form D $x$, where D is V for a vertical cut and H for a horizontal cut, and $x$ is the number of the column or row before which the cut is made. Rows are numbered from 1 to $n$ and columns from 1 to $m$. If several answers are optimal, print a vertical cut if one exists. If there are still several, print the one with the smallest $x$.