#include<bits/stdc++.h>
#define ll long long
#define fo(i,a,b) for(ll (i)=(a);(i)<=(b);(i)++)
#define fd(i,a,b) for(ll (i)=(a);(i)>=(b);(i)--)
using namespace std;
int n,a,b;
void solve(){
	cin>>n>>a>>b;
	if(a>b){//left
		fo(j,1,n-1) cout<<"L";
		fo(j,1,n-1) cout<<"D";
		
		fo(j,1,b-1) cout<<"R";
		fo(j,1,n-a) cout<<"U";
	}
	else 
	{
		fo(j,1,n-1) cout<<"R";
		fo(j,1,n-1) cout<<"U";
		
		fo(j,1,a-1) cout<<"D";
		fo(j,1,n-b) cout<<"L";
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int T=1;
//	cin>>T;
	while(T--) solve();
	return 0;
}