#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(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 ans;
  auto move = [&](int h, int w) {
    rep(i, abs(h)) ans += (h > 0 ? 'U' : 'D');
    rep(i, abs(w)) ans += (w > 0 ? 'R' : 'L');
  };

  int h1 = ty - sy, w1 = tx - sx;
  move(h1, w1);

  int h2 = sy - ty, w2 = sx - tx;
  move(h2, w2);

  int h3 = ty - sy, w3 = tx - sx;
  ans += (w3 > 0 ? 'L' : 'R');
  h3 += (h3 > 0 ? 1 : -1);
  w3 += (w3 > 0 ? 1 : -1);
  move(h3, w3);
  ans += (h3 > 0 ? 'D' : 'U');

  int h4 = sy - ty, w4 = sx - tx;
  ans += (w4 > 0 ? 'L' : 'R');
  h4 += (h4 > 0 ? 1 : -1);
  w4 += (w4 > 0 ? 1 : -1);
  move(h4, w4);
  ans += (h4 > 0 ? 'D' : 'U');

  cout << ans << endl;
  return 0;
}

#include <bits/stdc++.h>
//#include <atcoder/all>
#define ll long long int
#define MOD 1000000007
#define P pair<ll,ll>
#define INF 1000000000000000000

//using namespace atcoder;
using namespace std;

string transform(string t, ll x, ll y){
  for (ll i = 0; i < t.size(); i++){
    if (t[i] == 'R' && x < 0){
      t[i] = 'L'; 
    }
    else if (t[i] == 'L' && x < 0){
      t[i] = 'R'; 
    }
    else if (t[i] == 'U' && y < 0){
      t[i] = 'D'; 
    }
    else if (t[i] == 'D' && y < 0){
      t[i] = 'U'; 
    }
  }
  return t;
}

int main(void){
  ll sx, sy, tx, ty;
  cin >> sx >> sy >> tx >> ty;
  
  tx -= sx;
  ty -= sy;

  sx = tx;
  sy = ty;

  tx = abs(tx);
  ty = abs(ty);

  string t = "";
  // 1周目
  for (ll i = 0; i < ty; i++){
    t += "U";
  }
  for (ll i = 0; i < tx; i++){
    t += "R";
  }
  for (ll i = 0; i < ty; i++){
    t += "D";
  }
  for (ll i = 0; i < tx; i++){
    t += "L";
  }

  // 1周目
  t += "L";
  for (ll i = 0; i < ty + 1; i++){
    t += "U";
  }
  for (ll i = 0; i < tx + 1; i++){
    t += "R";
  }
  t += "D";
  t += "R";
  for (ll i = 0; i < ty + 1; i++){
    t += "D";
  }
  for (ll i = 0; i < tx + 1; i++){
    t += "L";
  }
  t += "U";

  cout << transform(t, sx, sy) << endl;
  for (ll i = 0; i < ty; i++){
    t += "D";
  }
  for (ll i = 0; i < tx; i++){
    t += "L";
  }



  return 0;
}
