Krishnakant is standing at in the Cartesian plane. He wants to go to the point in the same plane using only horizontal and vertical moves of unit. There are many ways of doing this, and he is writing down all such ways. Each way comprises of few moves and few moves. i.e. moves in horizontal and vertical direction respectively. For example, if Krishnakant wants to go to point from point , is one of the possible ways.

Given the value of , he wants to know lexicographically smallest way of going to from .

Input Format
The first line contains an integer , i.e., number of test cases.
Next lines will contain integers , and .

Output Format
For each test case, print lexicographically smallest path.

Constraints

Sample Input

2
2 2 2
2 2 3

Sample Output

HVVH
VHHV

Explanation

All the paths of going to from in lexicographically increasing order: