#ifdef __LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using PIL = pair<int,ll>;
using PLI = pair<ll,int>;
using PLL = pair<ll,ll>;
using Graph = vector<vector<int>>;
using Cost_Graph = vector<vector<PIL>>;

template<class T> bool chmin(T &a, T b) {if(a>b){a=b;return 1;}return 0;}
template<class T> bool chmax(T &a, T b) {if(a<b){a=b;return 1;}return 0;}
template<class T> void show_vec(T v) {for (int i=0;i<v.size();i++) cout<<v[i]<<endl;}
template<class T> void show_pair(T p) {cout<<p.first<<" "<<p.second<<endl;}
template<class T> bool judge_digit(T bit,T i) {return (((bit&(1LL<<i))!=0)?1:0);}
#define REP(i,n) for(int i=0;i<int(n);i++)
#define ROUNDUP(a,b) ((a+b-1)/b)
#define YESNO(T) cout<<(T?"YES":"NO")<<endl
#define yesno(T) cout<<(T?"yes":"no")<<endl
#define YesNo(T) cout<<(T?"Yes":"No")<<endl

const int INFint = 1 << 29;
const ll INFLL = 1LL << 60;
const ll MOD = 1000000007LL;
const vector<int> h_idx4 = {-1, 0,0,1};
const vector<int> w_idx4 = { 0,-1,1,0};
const vector<int> h_idx8 = {-1,-1,-1, 0,0, 1,1,1};
const vector<int> w_idx8 = {-1, 0, 1,-1,1,-1,0,1};

vector<ll> result;

struct Point {
    int pi,pj;
};

string calc_path(Point s,Point t){
    int di = t.pi - s.pi, dj = t.pj - s.pj;
    // cout << di << " " << dj << endl;
    string res;
    if (di > 0){
        for (int i = 0; i < di; i++){
            res.push_back('D');
        }
    }
    else{
        for (int i = 0; i < -di; i++){
            res.push_back('U');
        }
    }

    if (dj > 0){
        for (int i = 0; i < dj; i++){
            res.push_back('R');
        }
    }
    else{
        for (int i = 0; i < -dj; i++){
            res.push_back('L');
        }
    }

    return res;
}

void input_point(Point &s,Point &t){
    cin >> s.pi >> s.pj >> t.pi >> t.pj;
    return;
}

void input_score(){
    ll x;
    cin >> x;
    result.push_back(x);

    return;
}

void output_part(string s){
    cout << s << endl;
}

void solve_part(){
    Point s,t;
    input_point(s,t);

    string res = calc_path(s,t);

    output_part(res);

    input_score();
}

void solve(){
    for (int i = 0; i < 1000; i++){
        solve_part();
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    solve();

    return 0;
}
#include <iostream>
#include <vector>

int main()
{
    for (int query = 0; query < 1000; query++)
    {
        int si, sj, ti, tj;
        std::cin >> si >> sj >> ti >> tj;
        for (int i = 0; i < std::max(si - ti, 0); i++)
        {
            std::cout << 'U';
        }
        for (int i = 0; i < std::max(ti - si, 0); i++)
        {
            std::cout << 'D';
        }
        for (int i = 0; i < std::max(sj - tj, 0); i++)
        {
            std::cout << 'L';
        }
        for (int i = 0; i < std::max(tj - sj, 0); i++)
        {
            std::cout << 'R';
        }
        std::cout << std::endl;
        int response;
        std::cin >> response;
    }
    return 0;
}
