// Original C++ solution (slower):
#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <cmath>

#include <queue>

#include <stack>

#include <map>

#include <set>

#include <vector>

#include <iomanip>

#define ALL(x) (x).begin(), (x).end()

#define dll(x) scanf("%I64d",&x)

#define xll(x) printf("%I64d\n",x)

#define sz(a) int(a.size())

#define all(a) a.begin(), a.end()

#define rep(i,x,n) for(int i=x;i<n;i++)

#define repd(i,x,n) for(int i=x;i<=n;i++)

#define pii pair<int,int>

#define pll pair<long long ,long long>

#define gbtb ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)

#define MS0(X) memset((X), 0, sizeof((X)))

#define MSC0(X) memset((X), '\0', sizeof((X)))

#define pb push_back

#define mp make_pair

#define fi first

#define se second

#define eps 1e-6

#define gg(x) getInt(&x)

#define db(x) cout<<"== [ "<<x<<" ] =="<<endl;

using namespace std;

typedef long long ll;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}

ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll powmod(ll a,ll b,ll MOD){ll ans=1ll;while(b){if(b&1)ans=ans*a%MOD;a=a*a%MOD;b>>=1;}return ans;}

inline void getInt(int* p);

const int maxn=1000010;

const int inf=0x3f3f3f3f;

/*** TEMPLATE CODE * * STARTS HERE ***/



int main()

{

	//    freopen("C:\\Users\\DH_M\\Desktop\\code_io\\in.txt.txt","r",stdin);

	//    freopen("C:\\Users\\DH_M\\Desktop\\code_io\\out.txt.txt","w",stdout);

	int sx,sy;

	int tx,ty;

	cin>>sx>>sy>>tx>>ty;

	int sc=ty-sy;

	int yc=tx-sx;

	repd(i,1,sc)

	{

		cout<<"U";

	}

	repd(i,1,yc)

	{

		cout<<"R";

	}

	repd(i,1,sc)

	{

		cout<<"D";

	}

	repd(i,1,yc)

	{

		cout<<"L";

	}



	cout<<"L";

	repd(i,0,sc)

	{

		cout<<"U";

	}

	repd(i,0,yc)

	{

		cout<<"R";

	}

	cout<<"D";

	cout<<"R";

	repd(i,0,sc)

	{

		cout<<"D";

	}

	repd(i,0,yc)

	{

		cout<<"L";

	}

	cout<<"U";

    return 0;



}



inline void getInt(int* p) {char ch;do {ch = getchar();} 

while (ch == ' ' || ch == '\n');if (ch == '-') {*p = -(getchar() - '0');

while ((ch = getchar()) >= '0' && ch <= '9') {*p = *p * 10 - ch + '0';}}

else {*p = ch - '0';while ((ch = getchar()) >= '0' && ch <= '9') 

{*p = *p * 10 + ch - '0';}}}

// Optimized solution to the same problem (faster):
#include<cstdio>

#include<string.h>

#include<math.h>

using namespace std;

void move(int d, char ch)

{

    while(d)

    {

        printf("%c",ch);

        d--;

    }

}

int main()

{

    int x1,x2,y1,y2,x,y,i;

    while(scanf("%d %d %d %d",&x1,&y1,&x2,&y2)!=EOF)

    {

        int x=x2-x1;

        int y=y2-y1;

        for(i=1;i<=4;i++)

        {

            if(i==1)

            {

                move(y,'U');

                move(x,'R');

            }

            else if(i==2)

            {

                move(y,'D');

                move(x,'L');

            }

            else if(i==3)

            {

                printf("L");

                move(y+1,'U');

                move(x+1,'R');

                printf("D");

            }

            else

            {

                printf("R");

                move(y+1,'D');

                move(x+1,'L');

                printf("U");

            }

        }

        printf("\n");

    }

    return 0;

}

// Fastest known solution for this problem: