#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const int N = 2E5 + 10, mod = 1E9 + 7;

void solve() {
	int n, a, b;
	cin >> n >> a >> b;
	string ans1 = "", ans2 = "", ans3 = "", ans4 = "";
	for (int i = 0; i < n - 1; i ++) {
		ans1 = ans1 + "UL";
		ans2 = ans2 + "DR";
		ans3 = ans3 + "UR";
		ans4 = ans4 + "DL";
	}

	for (int i = 0; i < a - 1; i ++) {
		ans1 = ans1 + "D";
	}
	for (int i = 0; i < b - 1; i ++) {
		ans1 = ans1 + "R";
	}

	for (int i = 0; i < n - a; i ++) {
		ans2 = ans2 + "U";
	}
	for (int i = 0; i < n - b; i ++) {
		ans2 = ans2 + "L";
	}

	for (int i = 0; i < a - 1; i ++) {
		ans3 = ans3 + "D";
	}
	for (int i = 0; i < n - b; i ++) {
		ans3 = ans3 + "L";
	}

	for (int i = 0; i < n - a; i ++) {
		ans4 = ans4 + "U";
	}
	for (int i = 0; i < b - 1; i ++) {
		ans4 = ans4 + "R";
	}
	if (ans1.size() < ans2.size() && ans1.size() < ans3.size() && ans1.size() < ans4.size()) {
		cout << ans1 << '\n';
	} else if (ans2.size() < ans3.size() && ans2.size() < ans4.size()) {
		cout << ans2 << '\n';
	} else if (ans3.size() < ans4.size()) {
		cout << ans3 << '\n';
	} else {
		cout << ans4 << '\n';
	}
} 

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr); cout.tie(nullptr);
	int t = 1;
	// cin >> t;
	while (t --) {
		solve();
	}
	return 0;
}