D. L-Covering
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Given a grid with $$$n$$$ rows and $$$m$$$ columns, where rows are numbered from $$$1$$$ to $$$n$$$ from top to bottom, and columns are numbered from $$$1$$$ to $$$m$$$ from left to right. Now there are infinite $$$1+1$$$ L-shape tiles (as shown in the figure below), you need to use these tiles to cover the grid, so that only the cell in the $$$1$$$-st row and $$$m$$$-th column (located at the top right corner) is not covered, and each other cell is covered by exactly one tile. You need to determine if it is possible to achieve a covering that satisfies these conditions, and if so, output one covering scheme.

Input

The first line contains an integer $$$T$$$ ($$$1\le T\le 10^4$$$), indicating the number of test cases.

For each test case, there is a line containing two integers $$$n,m$$$ ($$$2\le n,m\le 500$$$), representing the size of the grid to be covered.

It is guaranteed that the sum of all $$$n\times m$$$ for the test cases does not exceed $$$10^6$$$.

Output

For each test case, if it is not possible to achieve a covering that satisfies the conditions, output No on a single line.

Otherwise, first output Yes on a single line, then output $$$n$$$ lines, each containing a string of length $$$m$$$, representing one covering scheme. The string contains only the six characters UDLRC.. The $$$j$$$-th character in the $$$i$$$-th line represents the covering situation of the cell in the $$$i$$$-th row and $$$j$$$-th column of the grid. The character . represents a cell that is not covered. For the output covering scheme, there should be only one . located in the $$$1$$$-st row and $$$m$$$-th column. The character C represents the center of the tile (i.e., the bottom left corner of the tile). The characters UDLR respectively represent the fact that the top, bottom, left, right cell of this cell is covered by the center of the tile. You should ensure that each cell is covered by only one tile, except for the top right corner cell.

Example
Input
2
4 4
2 3
Output
Yes
CLD.
UDCL
DCLD
CLRC
No
Note

For the first test case, one possible covering scheme is shown in the figure below.