#include<bits/stdc++.h>
using namespace std;
int main() {
	srand(time(0)); 
	for(int c=1; c<=1000; c++) {
		int x1,y1,x2,y2;
		cin>>x1>>y1>>x2>>y2;
		x1++,y1++,x2++,y2++;
		string s="";
		for(int i=x1; i<=x2-1; i++) {
			s+='D';
		}
		for(int i=x2; i<=x1-1; i++) {
			s+='U';
		}
		for(int i=y1; i<=y2-1; i++) {
			s+='R';
		}
		for(int i=y2; i<=y1-1; i++) {
			s+='L';
		}
		random_shuffle(s.begin(),s.end());
		cout<<s<<"\n";
		fflush(stdout);
		int x;
		cin>>x;
	}
}
#include <iostream>
#include <vector>
#include <string>
#define rep(i, n) for(int i = 0; i < (n); ++i)
using namespace std;

pair<int, int> divmod(int a, int b) { return make_pair(a / b, a % b); }

class Solver {
private:
    const int n = 30;
    double score = 0.0;

    pair<int, int> input_query() {
        int si, sj, ti, tj;
        cin >> si >> sj >> ti >> tj;
        return make_pair(si * n + sj, ti * n + tj);
    }

    void output(string path) { cout << path << endl; }

    void input_score() { int in; cin >> in; }

    string query(int s, int t) {
        auto[si, sj] = divmod(s, n);
        auto[ti, tj] = divmod(t, n);
        string res = "";
        int di = ti - si;
        int dj = tj - sj;
        if(di > 0) res += string(di, 'D');
        else res += string(-di, 'U');
        if(dj > 0) res += string(dj, 'R');
        else res += string(-dj, 'L');
        return res;
    }

public:
    void solve() {
        rep(k, 1000) {
            auto[s, t] = input_query();
            string path = query(s, t);
            output(path);
            input_score();
        }
    }
};

int main() {
    Solver solver;
    solver.solve();
    return 0;
}
