#include<algorithm>
#include<array>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<unordered_map>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define endl '\n'
using namespace std;
using ll=long long;
using db=double;
using pii=pair<int,int>;
const int inf=0x3f3f3f3f;
const int mod=998244353;
const int N=2e5+10,M=1e3+10;

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,a,b;
    cin >> n >> a >> b;
    if(a<=(n+1)/2&&b<=(n+1)/2)//左下
    {
        for(int i=1;i<n;i++)cout << "U";
        for(int i=1;i<n;i++)cout << "L";
        pii pos={1,1};
        while(pos.fi<a)
        {
            pos.fi++;
            cout << "D";
        }
        while(pos.se<b)
        {
            pos.se++;
            cout << "R";
        }
    }
    else if(a<=(n+1)/2)//右下
    {
        for(int i=1;i<n;i++)cout << "U";
        for(int i=1;i<n;i++)cout << "R";
        pii pos={1,n};
        while(pos.fi<a)
        {
            pos.fi++;
            cout << "D";
        }
        while(pos.se>b)
        {
            pos.se--;
            cout << "L";
        }
    }
    else if(b<=(n+1)/2)//左上
    {
        for(int i=1;i<n;i++)cout << "D";
        for(int i=1;i<n;i++)cout << "L";
        pii pos={n,1};
        while(pos.fi>a)
        {
            pos.fi--;
            cout << "U";
        }
        while(pos.se<b)
        {
            pos.se++;
            cout << "R";
        }
    }
    else//右上
    {
        for(int i=1;i<n;i++)cout << "D";
        for(int i=1;i<n;i++)cout << "R";
        pii pos={n,n};
        while(pos.fi>a)
        {
            pos.fi--;
            cout << "U";
        }
        while(pos.se>b)
        {
            pos.se--;
            cout << "L";
        }
    }
    cout << endl;
    return 0;
}