Oops, It's Yesterday Twice More

In 2018, 2019, and 2020, Nanjing University of Aeronautics and Astronautics (NUAA) hosted the International Collegiate Programming Contest (ICPC) Nanjing regional. In 2021, NUAA hosts it for the fourth time.

Team Power of Two and team Three Hold Two from Tsinghua University won the championship in 2018 and 2019. In 2020, team Inverted Cross from Peking University won. In 2021, around $700$ teams, including the defending champion, take part in the contest. Who will win this year?

The pandemic prevents us from gathering in Nanjing this time. We thank all staff and volunteers for their hard work on this contest.

In the 2018 contest, problem K, Kangaroo Puzzle, asked contestants to construct an operation sequence for this game:

The puzzle is a grid with $n$ rows and $m$ columns ($1 \le n, m \le 20$), and some (at least $2$) kangaroos stand in the puzzle. The player's goal is to control them so that they gather together. Some cells have walls, and kangaroos cannot enter those cells. The other cells are empty. Kangaroos can move from an empty cell to an adjacent empty cell in four directions: up, down, left, and right.

At the beginning, there is exactly one kangaroo in every empty cell. The player controls the kangaroos by pressing the buttons U, D, L, R on the keyboard. The kangaroos move simultaneously according to the button pressed.

The contestant must construct an operating sequence of at most $5 \times 10^4$ steps, consisting only of U, D, L, R, to achieve the goal.

In the 2020 contest, problem A, Ah, It's Yesterday Once More, asked contestants to construct an input map that hacks the following code for the problem described above:

#include <bits/stdc++.h>
using namespace std;
string s = "UDLR";
int main()
{
  srand(time(NULL));
  for (int i = 1; i ≤ 50000; i++) putchar(s[rand() % 4]);
  return 0;
}

In the 2021 contest, Paimon prepares another version of the problem. You are given a grid with $n$ rows and $n$ columns ($2 \leq n \leq 500$). All cells are empty, and one kangaroo stands in each cell.

You control the kangaroos with the buttons U, D, L, R. The kangaroos move simultaneously according to the button pressed. For a kangaroo in the cell in row $i$ and column $j$, denoted $(i,j)$:

1. Button U: it moves to $(i-1,j)$ if $i>1$. Otherwise, it stays in the same cell.
2. Button D: it moves to $(i+1,j)$ if $i<n$. Otherwise, it stays in the same cell.
3. Button L: it moves to $(i,j-1)$ if $j>1$. Otherwise, it stays in the same cell.
4. Button R: it moves to $(i,j+1)$ if $j<n$. Otherwise, it stays in the same cell.

You must construct an operating sequence consisting only of the characters 'U', 'D', 'L', and 'R'. After applying it, every kangaroo must gather at the cell $(a,b)$. The length of the sequence cannot exceed $3(n-1)$.

There is only one test case in each test file.

The first and only line contains three integers $n$, $a$, $b$ ($2 \leq n \leq 500$, $1 \leq a,b \leq n$), the size of the grid and the target cell.

Output one line containing a string made only of the characters 'U', 'D', 'L', and 'R'. Its length must not exceed $3(n-1)$. It can be proved that such an answer always exists.