#include<bits/stdc++.h>
#define x first
#define y second
#define PB push_back
#define mst(x,a) memset(x,a,sizeof(x))
#define all(a) begin(a),end(a)
#define rep(x,l,u) for(ll x=l;x<u;x++)
#define rrep(x,l,u) for(ll x=l;x>=u;x--)
#define sz(x) x.size()
#define IOS ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<char,char> PCC;
typedef long long ll;
typedef pair<ll,ll> PLL;
const int N=210;
const int M=1e6+10;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
void solve(){
int n,m,k;cin>>n>>m>>k;
int mxx=0,mxy=0;
rep(i,0,k){
int a,b;cin>>a>>b;
mxx=max(mxx,a);
mxy=max(mxy,b);
}
rep(i,0,k){
int a,b;cin>>a>>b;
}
string ans;
rrep(i,mxx,1) ans+='U';
rrep(i,mxy,1) ans+='L';
rep(i,1,n+1){
if(i&1){
rep(j,1,m) ans+='R';
}else{
rep(j,1,m) ans+='L';
}
if(i!=n) ans+='D';
}
cout<<sz(ans)<<endl;
cout<<ans<<endl;
}
int main(){
//IOS;
//freopen("test.txt", "r", stdin);
//freopen("test.txt", "w", stdout);
//int t;cin>>t;
//while(t--)
solve();
return 0;
}