#include<iostream>
#include<bits/stdc++.h>
 
using namespace std;

string calcpath(int si, int sj, int ti, int tj) {
  int i = ti - si;
  int j = tj - sj;
  
  char v = 'D';
  if(i < 0) {
    v = 'U';
  }
  char h = 'R';
  if(j < 0) {
    h = 'L';
  }

  string path = "";

  for(int x = 0; x < abs(i); x++) {
    path += v;
  }
  for(int x = 0; x < abs(j); x++) {
    path += h;
  }
  
  string random_path = "";
  
  while(path.size() > 0) {
    random_device rnd;
    mt19937 mt(rnd());
    uniform_int_distribution<> rand100(0, path.size() - 1);
    int r = rand100(mt);
    random_path += path[r];
    path = path.erase(r, 1);
  }
  
  return random_path;
}

int main()
{
  int si;
  int sj;
  int ti;
  int tj;
  
  int path_length;
    
  for(int loop = 0; loop < 1000; loop++) {
    cin >> si;
    cin >> sj;
    cin >> ti;
    cin >> tj;

    int i = ti - si;
  	int j = tj - sj;
        
    string path = calcpath(si, sj, ti, tj);
        
    cout << path << endl;
    cin >> path_length;
  }

  return 0;
}
//#include <atcoder/all>
//using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for(int i=0; i<n; i++)
#define REPR(i, n) for(int i=n-1; i>=0; i--)
#define FOR(i, m, n) for(int i=m; i<n; i++)
#define ALL(v) v.begin(), v.end()
#define bit(n) (1LL<<(n))
#define FIX(d) fixed << setprecision(d)
using P = pair<int, int>;
using LP = pair<ll, ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = 1e9;
const ll LINF = (1LL<<60);

int di[] = {-1, 1, 0, 0};
int dj[] = {0, 0, -1, 1};
const int H = 30, W = 30;

struct edge
{
  int to;
  int cost;
  
  edge(int _to, int _cost){
    to = _to;
    cost = _cost;
  }  
};
using Graph = vector<vector<edge>>;

// 経路復元用
vector<ll> dijkstra(int s, const Graph &G, vector<int> &prev)
{
  int n = G.size();
  priority_queue<P, vector<P>, greater<P>> que;
  vector<ll> d(n, INF);
  prev.resize(n, -1);
  d[s] = 0;
  que.emplace(0, s);

  while (!que.empty()){
    P p = que.top();
    que.pop();
    int v = p.second;
    if (d[v] < p.first) continue;

    for(auto nv: G[v]){
      if (d[nv.to] > d[v] + nv.cost){
        d[nv.to] = d[v] + nv.cost;
        prev[nv.to] = v;
        que.emplace(d[nv.to], nv.to);
      }
    }
  }
  return d;
}

string get_path(const vector<int> &prev, int t) {
  vector<int> path;
  for (int cur = t; cur != -1; cur = prev[cur]) {
    path.push_back(cur);
  }
  reverse(path.begin(), path.end()); 

  string pathString = "";
  REP(i,path.size()-1){
    if(path[i]-path[i+1]==1) pathString.push_back('L');
    else if(path[i]-path[i+1]==-1) pathString.push_back('R');
    else if(path[i]-path[i+1]==W) pathString.push_back('U');
    else pathString.push_back('D');
  }

  return pathString;
}

unsigned int xor128(){
  static unsigned int x=123456789,y=362436069,z=521288629,w=88675123;
  unsigned int t = (x^(x<<11));
  x=y; y=z; z=w; 
  return( w=(w^(w>>19))^(t^(t>>8)) );
}

void init(Graph &G){
  REP(i,H) REP(j,W){
    int cur = i*W+j;
    REP(k,4){
      int ni = i+di[k];
      int nj = j+dj[k];
      if(ni<0 || ni>=H || nj<0 || nj>=H) continue;
      int next = ni*W+nj;
      G[cur].push_back(edge(next, 1000));
      G[next].push_back(edge(cur, 1000));
    }
  }
}

int main() {
  Graph G(H*W);
  init(G);

  REP(q,1000){
    int si, sj, ti, tj;
    cin >> si >> sj >> ti >> tj;
    int sp = si*W+sj;
    int tp = ti*W+tj;
    vector<int> prev;
    auto dist = dijkstra(sp, G, prev);
    string path = get_path(prev, tp);
    cout << path << endl;

    int score;
    cin >> score;
    double e = (9.0 + double(xor128() % 3)) * 0.1;
    score = round((double)score / e);
    int score_per = score / path.size();
    int cur = tp;
    while(cur!=sp){
      int next = prev[cur];
      for(auto &eg: G[cur]){
        if(eg.to!=next) continue;
        //chmax(eg.cost, score_per);
        eg.cost = score_per;
      }
      for(auto &eg: G[next]){
        if(eg.to!=cur) continue;
        //chmax(eg.cost, score_per);
        eg.cost = score_per;
      }
      cur = next;
    }
  }
  
  return 0;
}
