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

typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<double, int> P;
#define rep(i, x) for (int i = 0; i < x; i++)

auto start = std::chrono::system_clock::now();
int cnt = 0;

double gettime() {
    auto end = std::chrono::system_clock::now();
    double ms = std::chrono::duration_cast<std::chrono::milliseconds>(end - start).count();
    return ms;
}

bool finish() {
    if (cnt % 100 == 0 && gettime() > 1980)
        return true;
    else
        return false;
}

bool LOCAL_TEST = false;
vvi h(30, vi(29)), v(29, vi(30));
int si, sj, ti, tj, a, prev_result;
double e, score;

string query() {
    string res;
    int di = ti - si;
    if (di >= 0) {
        rep(l, di) { res += "D"; }
    } else {
        rep(l, -di) { res += "U"; }
    }
    int dj = tj - sj;
    if (dj >= 0) {
        rep(l, dj) { res += "R"; }
    } else {
        rep(l, -dj) { res += "L"; }
    }
    return res;
}

int main() {
    start = std::chrono::system_clock::now();
    if (LOCAL_TEST) {
        rep(i, 30) rep(j, 29) cin >> h[i][j];
        rep(i, 29) rep(j, 30) cin >> v[i][j];
    }
    prev_result = 0;
    score = 0.0;
    for (int k = 0; k < 1000; k++) {
        if (LOCAL_TEST) {
            cin >> si >> sj >> ti >> tj >> a >> e;
        } else {
            cin >> si >> sj >> ti >> tj;
        }
        string path = query();
        cout << path << endl;
        if (LOCAL_TEST) {
            int b = path.length();
            score = score * 0.998 + a / b;
            prev_result = round(b * e);
        } else {
            cin >> prev_result;
        }
    }
    if (LOCAL_TEST) {
        cout << round(2312311 * score) << endl;
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;

ll solve(){
    int si, sj, ti, tj;
    cin >> si >> sj >> ti >> tj;
    int v = ti - si;
    int h = tj - sj;
    string rou;
    if(v>0) rou += string(v,'D');
    else rou+= string(-v, 'U');
    if(h>0) rou += string(h, 'R');
    else rou += string(-h, 'L');
    cout << rou << endl;
    ll score;
    cin >> score;
    return score;
}

int main(){
    rep(q, 1000){
        solve();
    }
    return 0;
}