Travel Round the Grid

题号：NC237466
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
Special Judge, 64bit IO Format: %lld

题目描述

Little G lives in the Grid Country. The Grid Country can be regarded as $n*m$ points, the top left is $(1,1)$ and the bottom right is $(n,m)$ , and Little G lives in $(a,b)$ .

One day, Little G wants to travel round the country for $k$ days. Every day, Little G can move up, down, left or right one step. More formally, $(a,b) -> (a-1,b)$ if Little G move up, $(a,b) -> (a+1,b)$ if Little G move down, $(a,b) -> (a,b-1)$ if Little G move left, $(a,b) -> (a,b+1)$ if Little G move right.

After $k$ -days travel, Little G must return home, the point $(a,b)$ (but Little G doesn't want to return home before the end of the $k$ -days travel). Also, Little G don't want to visit any point twice and Little G can't move out of the country.

Please design a travel route for Little G. The travel route is a string of length $k$ , consists of only ‘U’,‘D’,‘L’,‘R’, which means move up, down, left or right on this day.

输入描述:

The first line contains a single integer $T$ - the number of test cases.

Each of the next $T$ lines contains five integers $n,m,a,b,k$ $(2 \le n,m \le 10^6, 1 \le a \le n, 1 \le b \le m, 1 \le k \le n*m)$

It is guaranteed their exist a valid route for each test case, and $\sum k \le 10^6$ .

输出描述:

For each test case, output a valid travel route.

示例1

输入

复制

输出

复制

RL
URDL
DDRURULL