#include <bits/stdc++.h>
#include <string>
#include <vector>
#define rep(i,n) for (int i = 0;i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;




int main(){
    int sx,sy,tx,ty;
    cin >> sx >> sy >> tx >> ty;
    string f="",b="";
    rep(i,ty-sy)f.push_back('U');
    rep(i,tx-sx)f.push_back('R');
    rep(i,ty-sy)b.push_back('D');
    rep(i,tx-sx)b.push_back('L');

    cout << f << b << "LU" << f <<"RDRD" << b << "LU"<<endl;

}

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void solve(long long sx, long long sy, long long tx, long long ty){
    ll dx = (tx - sx);
    ll dy = (ty - sy);
    string ans = "";
    ans = ans + string(dy, 'U') + string(dx, 'R');
    ans = ans + string(dy, 'D') + string(dx, 'L');
    ans = ans + 'L' + string(dy+1, 'U') + string(dx+1, 'R') + 'D';
    ans = ans + 'R' + string(dy+1, 'D') + string(dx+1, 'L') + 'U';
    cout << ans << endl;
    return;
}

int main(){
    long long sx;
    scanf("%lld",&sx);
    long long sy;
    scanf("%lld",&sy);
    long long tx;
    scanf("%lld",&tx);
    long long ty;
    scanf("%lld",&ty);
    solve(sx, sy, tx, ty);
    return 0;
}
