#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define PII pair<int, int>
const int N = 1e6 + 5;
const int M = 1e5 + 5;

int ans, x, y, n, m, q;
int arr[N];

void solve()
{
    int n, a, b;
    cin >> n >> a >> b;
    PII pos = {1, 1};
    int d = 1e9;
    if (d > abs(a - 1) + abs(b - 1))
    {
        pos = {1, 1};
        d = abs(a - 1) + abs(b - 1);
    }
    if (d > abs(a - 1) + abs(b - n))
    {
        pos = {1, n};
        d = abs(a - 1) + abs(b - n);
    }
    if (d > abs(a - n) + abs(b - 1))
    {
        pos = {n, 1};
        d = abs(a - n) + abs(b - 1);
    }
    if (d > abs(a - n) + abs(b - n))
    {
        pos = {n, n};
        d = abs(a - n) + abs(b - n);
    }
    string ans;
    if (pos == (PII){1, 1})
    {
        for (int i = 1; i <= n - 1; i++)
            ans += 'U';
        for (int i = 1; i <= n - 1; i++)
            ans += 'L';

        int x = 1, y = 1;
        while (x < a)
        {
            ans += 'D';
            x++;
        }
        while (x > a)
        {
            ans += 'U';
            x--;
        }
        while (y < b)
        {
            ans += 'R';
            y++;
        }
        while (y > b)
        {
            ans += 'L';
            y--;
        }
    }
    if (pos == (PII){1, n})
    {
        for (int i = 1; i <= n - 1; i++)
            ans += 'U';
        for (int i = 1; i <= n - 1; i++)
            ans += 'R';

        int x = 1, y = n;
        while (x < a)
        {
            ans += 'D';
            x++;
        }
        while (x > a)
        {
            ans += 'U';
            x--;
        }
        while (y < b)
        {
            ans += 'R';
            y++;
        }
        while (y > b)
        {
            ans += 'L';
            y--;
        }
    }
    if (pos == (PII){n, 1})
    {
        for (int i = 1; i <= n - 1; i++)
            ans += 'D';
        for (int i = 1; i <= n - 1; i++)
            ans += 'L';

        int x = n, y = 1;
        while (x < a)
        {
            ans += 'D';
            x++;
        }
        while (x > a)
        {
            ans += 'U';
            x--;
        }
        while (y < b)
        {
            ans += 'R';
            y++;
        }
        while (y > b)
        {
            ans += 'L';
            y--;
        }
    }
    if (pos == (PII){n, n})
    {
        for (int i = 1; i <= n - 1; i++)
            ans += 'D';
        for (int i = 1; i <= n - 1; i++)
            ans += 'R';

        int x = n, y = n;
        while (x < a)
        {
            ans += 'D';
            x++;
        }
        while (x > a)
        {
            ans += 'U';
            x--;
        }
        while (y < b)
        {
            ans += 'R';
            y++;
        }
        while (y > b)
        {
            ans += 'L';
            y--;
        }
    }
    cout << ans << endl;
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t = 1; // cin>>t;
    while (t--)
    {
        solve();
    }

    return 0;
}