#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main(){
  int sx, sy;
  cin >> sx >> sy;
  int tx, ty;
  cin >> tx >> ty;
  int dx = tx - sx, dy = ty - sy;
  cout << string(dy, 'U');
  cout << string(dx, 'R');
  cout << string(dy, 'D');
  cout << string(dx, 'L');
  cout << 'L';
  cout << string(dy+1, 'U');
  cout << string(dx+1, 'R');
  cout << "DR";
  cout << string(dy+1, 'D');
  cout << string(dx+1, 'L');
  cout << "U" << endl;
  return 0;
}
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <set>
#include <map>
#include <list>
#include <cstdlib>
#include <queue>
#include <stack>
#include <bitset>

using namespace std;

#define MOD 1000000007
#define PI 3.1415926535897932
#define rep(i, n) for (int i = 0; i < n; i++)
#define repe(i, j, n) for (int i = j; i < n; i++)
#define repi(i, n) for (int i = 0; i <= n; i++)
#define repie(i, j, n) for (int i = j; i <= n; i++)
#define all(x) x.begin(), x.end()
#define println() cout << endl
#define P pair<int, int>
#define fi first
#define se second

typedef long long ll;

long long modinv(long long a, long long m)
{
    long long b = m, u = 1, v = 0;
    while (b)
    {
        long long t = a / b;
        a -= t * b;
        swap(a, b);
        u -= t * v;
        swap(u, v);
    }
    u %= m;
    if (u < 0)
        u += m;
    return u;
}

void solve1() {
    int sx, sy, tx, ty; cin >> sx >> sy >> tx >> ty;

    int ud = abs(sy-ty);
    int rl = abs(sx-tx);
    rep(i, ud) {
        cout << 'U';
    }

    rep(i, rl) {
        cout << 'R';
    }

    rep(i, ud)
    {
        cout << 'D';
    }

    rep(i, rl)
    {
        cout << 'L';
    }

    cout << 'L';

    rep(i, ud+1)
    {
        cout << 'U';
    }

    rep(i, rl+1)
    {
        cout << 'R';
    }

    cout << 'D';
    cout << 'R';

    rep(i, ud+1)
    {
        cout << 'D';
    }

    rep(i, rl+1)
    {
        cout << 'L';
    }

    cout << 'U' << endl;;
}

int main()
{
    solve1();
}
