#include <iostream>
#include <random>
#include <cmath>
#include <queue>
#include <utility>
#include <vector>
#include <algorithm>
#include <stack>
#include <cassert>

using namespace std;

const int SIZE = 30;
const int INF = 99999999;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const char dc[4] = {'D', 'R', 'U', 'L'};
struct Point {
  int i, j;
  Point() {}
  Point(int i, int j) : i(i), j(j) {}
  bool is_valid() {
    return (i >= 0) && (i < SIZE) && (j >= 0) && (j < SIZE);
  }
};

struct Edge {
  Point to;
  int n_passed = 0;
  double length = -1.0;
};

Edge graph[SIZE][SIZE][4];


deque<char> calculate_path(Point start, Point terminal) {
  bool visited[SIZE][SIZE];
  fill((bool*)visited, (bool*)visited+(SIZE*SIZE), false);
  //for (int i = 0; i < SIZE; ++i) {
  //  for (int j = 0; j < SIZE; ++j) {
  //    visited[i][j] = false;
  //  }
  //}
  int dist[SIZE][SIZE];
  fill((int*)dist, (int*)dist+(SIZE*SIZE), INF);
  int direction[SIZE][SIZE];
  fill((int*)direction, (int*)direction+(SIZE*SIZE), -1);
 
  stack<Point> s;
  visited[start.i][start.j] = true;
  dist[start.i][start.j] = 0;
  s.push(start);
  while (!s.empty()) {
    Point p = s.top(); s.pop();

    for (int dir = 0; dir < 4; ++dir) {
      Point np = p;
      np.i += dx[dir];
      np.j += dy[dir];

      if (np.is_valid() && !visited[np.i][np.j]) {
        visited[np.i][np.j] = true;
        dist[np.i][np.j] = dist[np.i][np.j] + graph[p.i][p.j][dir].length;
        direction[np.i][np.j] = dir;
        s.push(np);
      }
    }
  }

  deque<char> path;
  Point p = terminal;
  while (p.i != start.i || p.j != start.j) {
    int dir = direction[p.i][p.j];
    assert(dir >= 0 && dir < 4);
    path.push_front(dc[dir]);
    p.i -= dx[dir];
    p.j -= dy[dir];
  }

  return path;
}

void print_path(deque<char> path) {
  for (char c : path) {
    cout << c;
  }
  cout << endl << flush;
}

int main() {
  
  for (int i = 0; i < 1000; ++i) {
    // input start and terminal;
    Point s, t;
    cin >> s.i >> s.j >> t.i >> t.j;

    // calculate path
    deque<char> path = calculate_path(s, t);

    // output path
    print_path(path);

    // input path length
    int b;
    cin >> b;

    // update edge length
  }

}
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcount(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

/*string dijkstra(int sy,int sx,int gy,int gx){

}*/

int main(){
    int test=1000,sy,sx,gy,gx;
    int score;
    double d2;
    while(test--){
        cin>>sy>>sx>>gy>>gx;
        string s,t;
        if(gy>sy)s.resize(gy-sy,'D');
        else s.resize(sy-gy,'U');
        if(gx>sx)t.resize(gx-sx,'R');
        else t.resize(sx-gx,'L');
        cout<<s<<t<<endl;
        cin>>score;
    }
}