Collecting Packages

**本题目有多组测试。** ## 输入 第一行包含正整数$t\in[1,100]$，表示有$t$组测试数据。 以下每组测试数据包含正整数$n\in[1,1000]$，后接$n$个整数点的坐标$x_i,y_i\in[0,1000]$。 ## 输出 你的机器人从原点出发，**只**允许向**上**和向**右**运动。 如果你的机器人可以通过所有坐标，输出一行`YES`。然后按照下列要求输出一个字符串表示你的行走方法。 - 向上输出`U`。**不要**加空格。 - 向右输出`R`。**不要**加空格。 - 路径最短。 - 满足上述要求的前提下，尽量先向右，后向上。 - 输出完毕后换行。 如果不可以，输出一行`NO`即可。 需要注意，`No`，`Yes`，`kkksc03`，`kkkakioi`等不符合要求的字符串不被接受。

There is a robot in a warehouse and $ n $ packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point $ (0, 0) $ . The $ i $ -th package is at the point $ (x_i, y_i) $ . It is guaranteed that there are no two packages at the same point. It is also guaranteed that the point $ (0, 0) $ doesn't contain a package. The robot is semi-broken and only can move up ('U') and right ('R'). In other words, in one move the robot can go from the point $ (x, y) $ to the point ( $ x + 1, y $ ) or to the point $ (x, y + 1) $ . As we say above, the robot wants to collect all $ n $ packages (in arbitrary order). He wants to do it with the minimum possible number of moves. If there are several possible traversals, the robot wants to choose the lexicographically smallest path. The string $ s $ of length $ n $ is lexicographically less than the string $ t $ of length $ n $ if there is some index $ 1 \le j \le n $ that for all $ i $ from $ 1 $ to $ j-1 $ $ s_i = t_i $ and $ s_j < t_j $ . It is the standard comparison of string, like in a dictionary. Most programming languages compare strings in this way.

The first line of the input contains an integer $ t $ ( $ 1 \le t \le 100 $ ) — the number of test cases. Then test cases follow. The first line of a test case contains one integer $ n $ ( $ 1 \le n \le 1000 $ ) — the number of packages. The next $ n $ lines contain descriptions of packages. The $ i $ -th package is given as two integers $ x_i $ and $ y_i $ ( $ 0 \le x_i, y_i \le 1000 $ ) — the $ x $ -coordinate of the package and the $ y $ -coordinate of the package. It is guaranteed that there are no two packages at the same point. It is also guaranteed that the point $ (0, 0) $ doesn't contain a package. The sum of all values $ n $ over test cases in the test doesn't exceed $ 1000 $ .

Print the answer for each test case. If it is impossible to collect all $ n $ packages in some order starting from ( $ 0,0 $ ), print "NO" on the first line. Otherwise, print "YES" in the first line. Then print the shortest path — a string consisting of characters 'R' and 'U'. Among all such paths choose the lexicographically smallest path. Note that in this problem "YES" and "NO" can be only uppercase words, i.e. "Yes", "no" and "YeS" are not acceptable.

3
5
1 3
1 2
3 3
5 5
4 3
2
1 0
0 1
1
4 3

YES
RUUURRRRUU
NO
YES
RRRRUUU

For the first test case in the example the optimal path RUUURRRRUU is shown below: