#include <bits/stdc++.h>

#define int long long
#define fadd(a,b,c) for (int a=b;a<=c;a++)
#define fsub(a,b,c) for (int a=b;a>=c;a--)
#define F first
#define S second
#define CYes cout << "Yes\n"
#define CNo cout << "No\n"
#define CYES cout << "YES\n"
#define CNO cout << "NO\n"
#define println(a) cout << (a) << '\n'

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
void fastIO(){ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
class bhscer {
public:
    template<typename FIRST, typename ...PACK> static void debug(FIRST first, PACK... params) { std::cout<< first <<' '; debug(params...);}
    template<typename T> static void debug(T end) { std::cout << end << std::endl; }
};
const int N = 5e5;

void solve() {
	int n,a,b; cin >> n >> a >> b;
	int tax = 0, tay = 0;
	if (a<=n/2 && b<=n/2) {
		tax = 1;
		tay = 1;
	} else if (a<=n/2 && b>n/2) {
		tax = 1;
		tay = n;
	} else if (a>n/2 && b<=n/2) {
		tax = n;
		tay = 1;
	} else {
		tax = n;
		tay = n;
	}

	for (int i=1;i<n;i++) {
		if (tax == 1) cout << 'U';
		else cout << 'D';
	}
	for (int i=1;i<n;i++) {
		if (tay == 1) cout << 'L';
		else cout << 'R';
	}

	while (a != tax) {
		if (a > tax) {
			cout << 'D';
			tax ++;
		} else {
			cout << 'U';
			tax --;
		}
	}

	while (b != tay) {
		if (b > tay) {
			cout << 'R';
			tay ++;
		} else {
			cout << 'L';
			tay --;
		}
	}
}
signed main() {
	fastIO();
	int _ = 1;
	while (_--) {
		solve();
	}
	
	return 0;
}