영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
Given an n × m grid and two squares a=(y_1,x_1) and b=(y_2,x_2), create a path from a to b that visits each square exactly once.
For example, here is a path from a=(1,3) to b=(3,6) in a 4 × 7 grid:
(그림은 원문 페이지에서 볼 수 있습니다)
Input
The first input line has an integer t: the number of tests.
After this, there are t lines that describe the tests. Each line has six integers n, m, y_1, x_1, y_2 and x_2.
In all tests 1 ≤ y_1,y_2 ≤ n and 1 ≤ x_1,x_2 ≤ m. In addition, y_1 ≠ y_2 or x_1 ≠ x_2.
Output
Print YES, if it is possible to construct a path, and NO otherwise.
If there is a path, also print its description which consists of characters U (up), D (down), L (left) and R (right). If there are several paths, you can print any of them.
Constraints
- 1 ≤ t ≤ 100
- 1 ≤ n ≤ 50
- 1 ≤ m ≤ 50
예제
예제 1
5 1 3 1 1 1 3 1 3 1 2 1 3 2 2 1 1 2 2 2 2 1 1 2 1 4 7 1 3 3 6
YES RR NO NO YES RDL YES RRRRDDDLLLLLLUUURDDRURDRURD