!%?#$@ and Z-tube cat are watching seagulls.
In a grid with multiple rows and columns, there are initially $$$n$$$ seagulls and $$$n$$$ pieces of food, each located in a distinct cell.
You may direct the seagulls to find food. In each command, you must select one seagull in the grid and choose a direction: up (row index decreases, column index unchanged), down (row index increases, column index unchanged), left (row index unchanged, column index decreases), or right (row index unchanged, column index increases). The selected seagull will then fly in that direction to the nearest empty cell. When a seagull lands on a food-containing grid, it consumes the food and leaves the grid, meaning both the seagull and the food immediately disappear from the grid.
Please execute exactly $$$n$$$ commands to make all seagulls consume food and leave the grid, or report no solution.
Each test contains multiple test cases. The first line gives an integer $$$T(1\leq T\leq 10^3)$$$, indicating the number of test cases.
For each test case: The first line contains an integer $$$n(1\leq n\leq5000)$$$, representing $$$n$$$ seagulls, $$$n$$$ pieces of food, and $$$n$$$ commands to execute.
The next $$$n$$$ lines each contain two integers $$$r_i, c_i (1 \leq r_i, c_i \leq 5000)$$$. The two integers $$$r_i, c_i$$$ on the $$$i$$$th line indicate that the seagull with number $$$i$$$ initially occupies the cell at row $$$r_i$$$ and column $$$c_i$$$.
The next $$$n$$$ lines each contain two integers $$$r_i, c_i(1 \leq r_i, c_i \leq 5000)$$$, indicating that a piece of food initially occupies the cell at row $$$r_i$$$ and column $$$c_i$$$.
It is guaranteed that the initial positions of all seagulls and food items are distinct.
The total sum of $$$n$$$ across all test cases in each test is guaranteed not to exceed $$$5000$$$.
For each test case:
Output Yes or No on the first line, indicating whether the problem has a solution or not.
If a solution exists, output the following $$$n$$$ lines, each containing an integer $$$u_i$$$ and a character $$$c_i$$$ ($$$c_i \in \{U, D, L, R\}$$$) separated by a space. The integer $$$u_i$$$ in the $$$i$$$th line indicates you selected seagull $$$u_i$$$ in the $$$i$$$th command step, and the character $$$c_i$$$ is $$$\text{U}$$$, $$$\text{D}$$$, $$$\text{L}$$$, or $$$\text{R}$$$ representing the flight direction up, down, left, or right, respectively. If multiple command sequences are valid, output any one of them.
Note: Do not output any extra spaces.
5 4 2 1 4 1 1 4 3 3 1 1 5 1 1 3 3 4 4 1 3 2 2 2 3 3 3 1 2 2 1 3 2 4 3 1 1 1 1 3 4 2 3 3 2 3 3 2 2 2 4 3 1 4 3 1 2 2 2 2 1 1 1 3 1 2
Yes 1 U 2 D 3 L 4 R Yes 1 D 3 L 4 L 2 U No Yes 4 U 3 D 1 R 2 L No
| Name |
|---|


