#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vpii = vector<pii>;
#define repn(i, n) for (int i = 1; i <= (int)n; i++)
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repr(i, m, n) for (int i = (int)m; i <= (int)n; i++)
#define repd(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#ifdef LILYWHITE
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) ;
#endif
const int __attribute__((unused)) INF = 0x3f3f3f3f;
template <typename T> inline T rd(T &x) {
    x = 0;
    T neg = 1;
    char c = 0;
    while (c < '0' || c > '9') {
        if (c == '-')
            neg = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        x = x * 10 + c - 48;
        c = getchar();
    }
    x *= neg;
    return x;
}
template <typename T, typename... Args> inline void rd(T &x, Args &...args) {
    rd(x);
    rd(args...);
}

int main() {
    int n, a, b;
    rd(n, a, b);
    int dist1 = abs(a - 1) + abs(b - 1),   // (1, 1)
        dist2 = abs(a - n) + abs(b - n),   // (N, N)
        dist3 = abs(a - 1) + abs(b - n),   // (1, N)
        dist4 = abs(a - n) + abs(b - 1);   // (N, 1)
    eprintf("%d %d %d %d\n", dist1, dist2, dist3, dist4);
    int m = min(dist1, min(dist2, min(dist3, dist4)));
    if (dist1 == m) {
        rep(i, n - 1) cout.put('L');
        rep(i, n - 1) cout.put('U');
        rep(i, a - 1) cout.put('D');
        rep(i, b - 1) cout.put('R');
    } else if (dist2 == m) {
        rep(i, n - 1) cout.put('R');
        rep(i, n - 1) cout.put('D');
        rep(i, n - a) cout.put('U');
        rep(i, n - b) cout.put('L');
    } else if (dist3 == m) {
        rep(i, n - 1) cout.put('R');
        rep(i, n - 1) cout.put('U');
        rep(i, a - 1) cout.put('D');
        rep(i, n - b) cout.put('L');
    } else if (dist4 == m) {
        rep(i, n - 1) cout.put('L');
        rep(i, n - 1) cout.put('D');
        rep(i, n - a) cout.put('U');
        rep(i, b - 1) cout.put('R');
    }
}