stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

	int x1,y1,x2,y2;

	cin>>x1>>y1>>x2>>y2;

	for(int i=1;i<=y2-y1;i++)

	cout<<"U";

	for(int i=1;i<=x2-x1;i++)

	cout<<"R";

	for(int i=1;i<=y2-y1;i++)

	cout<<"D";

	for(int i=1;i<=x2-x1+1;i++)

	cout<<"L";

	for(int i=1;i<=y2-y1+1;i++)

	cout<<"U";

	for(int i=1;i<=x2-x1+1;i++)

	cout<<"R";

	cout<<"D";

	cout<<"R";

	for(int i=1;i<=y2-y1+1;i++)

	cout<<"D";

	for(int i=1;i<=x2-x1+1;i++)

	cout<<"L";

	cout<<"U"<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.198606035197939x):
#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <math.h>

#define INF 0x3f3f3f3f



char s[100];

typedef long long ll;



void step(int x, int y)

{

    for (int i = 0; i < y; ++i)

    {

        printf("U");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("R");

    }

    for (int i = 0; i < y; ++i)

    {

        printf("D");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("L");

    }

}



int main()

{

    //freopen("C:\\Users\\tiger\\Desktop\\a.txt","r",stdin);

	int x1,y1;

    int x2,y2;

    while ( ~scanf("%d %d %d %d", &x1, &y1, &x2, &y2) )

    {

        int x = x2 - x1;

        int y = y2 - y1;

        step(x,y);

        printf("L");

        for (int i = 0; i <= y; ++i)

        {

            printf("U");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("R");

        }

        printf("D");

        printf("R");

        for (int i = 0; i <= y; ++i)

        {

            printf("D");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("L");

        }

        printf("U\n");

    }

	return 0;

}
// Slower C++ solution:
//============================================================================

// Name        : test.cpp

// Author      : Qihan

// Version     :

// Copyright   : Your copyright notice

// Description : Hello World in C++, Ansi-style

//============================================================================



#include <bits/stdc++.h>

#define pi acos(-1.0)

using namespace std;

typedef long long int LLI;

typedef pair<LLI,LLI> PII;

#define Lowbit(x) (x & (-x))

const int inf = 0x3f3f3f;

const int maxn = (500000 + 10);





int main() {

//    freopen("/home/qihan/Documents/in","r",stdin);

//    freopen("/home/qihan/Documents/out","w",stdout);

	int sx,sy,ex,ey;

	scanf("%d%d%d%d",&sx,&sy,&ex,&ey);

	int x = ex - sx,y = ey - sy;

	for(int i = 1;i <= y;i ++)  printf("U");

	for(int i = 1;i <= x;i ++)  printf("R");

	for(int i = 1;i <= y;i ++)  printf("D");

	for(int i = 1;i <= x;i ++)  printf("L");

	printf("L");

	for(int i = 1;i <= y + 1;i ++)  printf("U");

	for(int i = 1;i <= x + 1;i ++)  printf("R");

	printf("D");

	printf("R");

	for(int i = 1;i <= y + 1;i ++)  printf("D");

	for(int i = 1;i <= x + 1;i ++)  printf("L");

	printf("U\n");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.13234246243833x):
#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <math.h>

#define INF 0x3f3f3f3f



char s[100];

typedef long long ll;



void step(int x, int y)

{

    for (int i = 0; i < y; ++i)

    {

        printf("U");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("R");

    }

    for (int i = 0; i < y; ++i)

    {

        printf("D");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("L");

    }

}



int main()

{

    //freopen("C:\\Users\\tiger\\Desktop\\a.txt","r",stdin);

	int x1,y1;

    int x2,y2;

    while ( ~scanf("%d %d %d %d", &x1, &y1, &x2, &y2) )

    {

        int x = x2 - x1;

        int y = y2 - y1;

        step(x,y);

        printf("L");

        for (int i = 0; i <= y; ++i)

        {

            printf("U");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("R");

        }

        printf("D");

        printf("R");

        for (int i = 0; i <= y; ++i)

        {

            printf("D");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("L");

        }

        printf("U\n");

    }

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int a[100000];

int main()

{

    int sx, sy, tx, ty;

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

    for(int i=1;i<=ty-sy;i++)

    {

        cout<< "U";

    }

    for(int i=1;i<=tx-sx;i++)

    {

        cout<< "R";

    }

    for(int i=1;i<=ty-sy;i++)

    {

        cout<< "D";

    }

    for(int i=1;i<=tx-sx;i++)

    {

        cout<< "L";

    }

    cout<< "L";

    for(int i=0;i<=ty-sy;i++)

    {

        cout<< "U";

    }

    cout<< "R";

    for(int i=1;i<=tx-sx;i++)

    {

        cout<< "R";

    }

    cout<< "D";

    cout<< "R";

    for(int i=0;i<=ty-sy;i++)

    {

        cout<< "D";

    }

    cout<< "L";

    for(int i=1;i<=tx-sx;i++)

    {

        cout<< "L";

    }

    cout <<"U" <<endl;  

}


// Faster C++ solution for the same problem (measured speedup: 5.20076751546895x):
#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <math.h>

#define INF 0x3f3f3f3f



char s[100];

typedef long long ll;



void step(int x, int y)

{

    for (int i = 0; i < y; ++i)

    {

        printf("U");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("R");

    }

    for (int i = 0; i < y; ++i)

    {

        printf("D");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("L");

    }

}



int main()

{

    //freopen("C:\\Users\\tiger\\Desktop\\a.txt","r",stdin);

	int x1,y1;

    int x2,y2;

    while ( ~scanf("%d %d %d %d", &x1, &y1, &x2, &y2) )

    {

        int x = x2 - x1;

        int y = y2 - y1;

        step(x,y);

        printf("L");

        for (int i = 0; i <= y; ++i)

        {

            printf("U");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("R");

        }

        printf("D");

        printf("R");

        for (int i = 0; i <= y; ++i)

        {

            printf("D");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("L");

        }

        printf("U\n");

    }

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstring>

#include <cstdio>

#include <algorithm>

#include <cmath>

#include <string>

#include <map>

#include <stack>

#include <queue>

#include <vector>

#define inf 0x3f3f3f3f

#define met(a,b) memset(a,b,sizeof a)

#define pb push_back

typedef long long ll;

using namespace std;

const int N = 20050;

const int M = 24005;

const int mod=1e9+7;

int n,m;

char str[N];

int main(){

    int tot=0;

    int sx,sy,ex,ey;

    scanf("%d%d%d%d",&sx,&sy,&ex,&ey);

    int x=ex-sx,y=ey-sy;

    for(int i=1;i<=y;i++)str[tot++]='U';

    for(int i=1;i<=x;i++)str[tot++]='R';

    for(int i=1;i<=y;i++)str[tot++]='D';

    for(int i=1;i<=x;i++)str[tot++]='L';

    str[tot++]='L';

    for(int i=1;i<=y+1;i++)str[tot++]='U';

    for(int i=1;i<=x+1;i++)str[tot++]='R';

    str[tot++]='D';

    str[tot++]='R';

    for(int i=1;i<=y+1;i++)str[tot++]='D';

    for(int i=1;i<=x+1;i++)str[tot++]='L';

    str[tot++]='U';

    str[tot]=0;

    printf("%s",str);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.12283913294564x):
#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <math.h>

#define INF 0x3f3f3f3f



char s[100];

typedef long long ll;



void step(int x, int y)

{

    for (int i = 0; i < y; ++i)

    {

        printf("U");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("R");

    }

    for (int i = 0; i < y; ++i)

    {

        printf("D");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("L");

    }

}



int main()

{

    //freopen("C:\\Users\\tiger\\Desktop\\a.txt","r",stdin);

	int x1,y1;

    int x2,y2;

    while ( ~scanf("%d %d %d %d", &x1, &y1, &x2, &y2) )

    {

        int x = x2 - x1;

        int y = y2 - y1;

        step(x,y);

        printf("L");

        for (int i = 0; i <= y; ++i)

        {

            printf("U");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("R");

        }

        printf("D");

        printf("R");

        for (int i = 0; i <= y; ++i)

        {

            printf("D");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("L");

        }

        printf("U\n");

    }

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int a[100000];

int main()

{

    int sx, sy, tx, ty;

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

    for(int i=1;i<=ty-sy;i++)

    {

        cout<<"U";

    }

    for(int i=1;i<=tx-sx;i++)

    {

        cout<<"R";

    }

    for(int i=1;i<=ty-sy;i++)

    {

        cout<<"D";

    }

    for(int i=1;i<=tx-sx;i++)

    {

        cout<<"L";

    }

    cout<<"L";

    for(int i=0;i<=ty-sy;i++)

    {

        cout<<"U";

    }

    cout<<"R";

    for(int i=1;i<=tx-sx;i++)

    {

        cout<<"R";

    }

    cout<<"D";

    cout<<"R";

    for(int i=0;i<=ty-sy;i++)

    {

        cout<<"D";

    }

    cout<<"L";

    for(int i=1;i<=tx-sx;i++)

    {

        cout<<"L";

    }

    cout<<"U";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.181363463654681x):
#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <math.h>

#define INF 0x3f3f3f3f



char s[100];

typedef long long ll;



void step(int x, int y)

{

    for (int i = 0; i < y; ++i)

    {

        printf("U");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("R");

    }

    for (int i = 0; i < y; ++i)

    {

        printf("D");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("L");

    }

}



int main()

{

    //freopen("C:\\Users\\tiger\\Desktop\\a.txt","r",stdin);

	int x1,y1;

    int x2,y2;

    while ( ~scanf("%d %d %d %d", &x1, &y1, &x2, &y2) )

    {

        int x = x2 - x1;

        int y = y2 - y1;

        step(x,y);

        printf("L");

        for (int i = 0; i <= y; ++i)

        {

            printf("U");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("R");

        }

        printf("D");

        printf("R");

        for (int i = 0; i <= y; ++i)

        {

            printf("D");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("L");

        }

        printf("U\n");

    }

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

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

#define per(i,a,n) for (int i=n;i>=a;i--)

#define pb push_back

#define mp make_pair

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

#define fi first

#define se second

#define SZ(x) ((int)(x).size())

using namespace std;

typedef vector<int> vi;

typedef long long ll;

typedef pair<int,int> pii;

const ll mod=1000000007;

ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}

const int maxn=1e5+10;



int main()

{

    int sx,sy,tx,ty;

    scanf("%d%d%d%d",&tx,&ty,&sx,&sy);

    for(int i = ty; i < sy; ++i) {

        printf("U");

    }

    for(int i = tx; i < sx; ++i) {

        printf("R");

    }

     for(int i = ty; i < sy; ++i) {

        printf("D");

    }

    for(int i = tx; i < sx; ++i) {

        printf("L");

    }

    printf("L");

     for(int i = ty; i < sy+1; ++i) {

        printf("U");

    }

    for(int i = tx; i < sx+1; ++i) {

        printf("R");

    }

    printf("DR");

     for(int i = ty; i < sy+1; ++i) {

        printf("D");

    }

    for(int i = tx; i < sx+1; ++i) {

        printf("L");

    }

    printf("U\n");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.133026918867235x):
#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <math.h>

#define INF 0x3f3f3f3f



char s[100];

typedef long long ll;



void step(int x, int y)

{

    for (int i = 0; i < y; ++i)

    {

        printf("U");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("R");

    }

    for (int i = 0; i < y; ++i)

    {

        printf("D");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("L");

    }

}



int main()

{

    //freopen("C:\\Users\\tiger\\Desktop\\a.txt","r",stdin);

	int x1,y1;

    int x2,y2;

    while ( ~scanf("%d %d %d %d", &x1, &y1, &x2, &y2) )

    {

        int x = x2 - x1;

        int y = y2 - y1;

        step(x,y);

        printf("L");

        for (int i = 0; i <= y; ++i)

        {

            printf("U");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("R");

        }

        printf("D");

        printf("R");

        for (int i = 0; i <= y; ++i)

        {

            printf("D");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("L");

        }

        printf("U\n");

    }

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

void print(char* c,int n)

{

    for(int i=0 ; i<n ; i++){

        cout << c;

    }

}

int main()

{

    int sx, sy, tx, ty;

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

    print("U",ty-sy);

    print("R",tx-sx);

    print("D",ty-sy);

    print("L",tx-sx);

    print("L",1);

    print("U",ty-sy+1);

    print("R",tx-sx+1);

    print("D",1);

    print("R",1);

    print("D",ty-sy+1);

    print("L",tx-sx+1);

    print("U",1);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.1803229647509985x):
#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <math.h>

#define INF 0x3f3f3f3f



char s[100];

typedef long long ll;



void step(int x, int y)

{

    for (int i = 0; i < y; ++i)

    {

        printf("U");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("R");

    }

    for (int i = 0; i < y; ++i)

    {

        printf("D");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("L");

    }

}



int main()

{

    //freopen("C:\\Users\\tiger\\Desktop\\a.txt","r",stdin);

	int x1,y1;

    int x2,y2;

    while ( ~scanf("%d %d %d %d", &x1, &y1, &x2, &y2) )

    {

        int x = x2 - x1;

        int y = y2 - y1;

        step(x,y);

        printf("L");

        for (int i = 0; i <= y; ++i)

        {

            printf("U");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("R");

        }

        printf("D");

        printf("R");

        for (int i = 0; i <= y; ++i)

        {

            printf("D");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("L");

        }

        printf("U\n");

    }

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <stdio.h>

#include <cstring>

using namespace std;



int main()

{

    int a,b,x,y;

    while(scanf("%d %d %d %d",&a,&b,&x,&y)!=EOF)

    {

        for(int i=0;i<y-b;++i)

            cout<<'U';

        for(int i=0;i<x-a;++i)

            cout<<'R';

        for(int i=0;i<y-b;++i)

            cout<<'D';

        for(int i=0;i<x-a;++i)

            cout<<'L';

        cout<<'L';

        for(int i=0;i<y-b+1;++i)

            cout<<'U';

        for(int i=0;i<x-a+1;++i)

            cout<<'R';

            cout<<"DR";

        for(int i=0;i<y-b+1;++i)

            cout<<'D';

        for(int i=0;i<x-a+1;++i)

            cout<<'L';

        cout<<'U'<<endl;

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.193537531183933x):
#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <math.h>

#define INF 0x3f3f3f3f



char s[100];

typedef long long ll;



void step(int x, int y)

{

    for (int i = 0; i < y; ++i)

    {

        printf("U");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("R");

    }

    for (int i = 0; i < y; ++i)

    {

        printf("D");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("L");

    }

}



int main()

{

    //freopen("C:\\Users\\tiger\\Desktop\\a.txt","r",stdin);

	int x1,y1;

    int x2,y2;

    while ( ~scanf("%d %d %d %d", &x1, &y1, &x2, &y2) )

    {

        int x = x2 - x1;

        int y = y2 - y1;

        step(x,y);

        printf("L");

        for (int i = 0; i <= y; ++i)

        {

            printf("U");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("R");

        }

        printf("D");

        printf("R");

        for (int i = 0; i <= y; ++i)

        {

            printf("D");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("L");

        }

        printf("U\n");

    }

	return 0;

}
// Slower C++ solution:
#include<cstdio>

#include<cstring>

#include<queue>

#include<algorithm>

#include<cmath>

#include<iostream>

using namespace std;

void print(int x,int y)

{

    int n=x,m=y;

    while(n--)

        putchar('U');

    while(m--)

        putchar('R');

    n=x,m=y;

    while(n--)

        putchar('D');

    while(m--)

        putchar('L');

    putchar('L');

    n=x,m=y;

    while(n--)

        putchar('U');

    putchar('U');

    while(m--)

        putchar('R');

    putchar('R');

    putchar('D');

    putchar('R');

    n=x,m=y;

    while(n--)

        putchar('D');

    putchar('D');

    while(m--)

        putchar('L');

    putchar('L');

    putchar('U');

putchar('\n');

}

int main()

{

    int sx,sy,ex,ey;

    while(scanf("%d%d%d%d",&sx,&sy,&ex,&ey)!=-1)

        print(ey-sy,ex-sx);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.114409334293568x):
#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <math.h>

#define INF 0x3f3f3f3f



char s[100];

typedef long long ll;



void step(int x, int y)

{

    for (int i = 0; i < y; ++i)

    {

        printf("U");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("R");

    }

    for (int i = 0; i < y; ++i)

    {

        printf("D");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("L");

    }

}



int main()

{

    //freopen("C:\\Users\\tiger\\Desktop\\a.txt","r",stdin);

	int x1,y1;

    int x2,y2;

    while ( ~scanf("%d %d %d %d", &x1, &y1, &x2, &y2) )

    {

        int x = x2 - x1;

        int y = y2 - y1;

        step(x,y);

        printf("L");

        for (int i = 0; i <= y; ++i)

        {

            printf("U");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("R");

        }

        printf("D");

        printf("R");

        for (int i = 0; i <= y; ++i)

        {

            printf("D");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("L");

        }

        printf("U\n");

    }

	return 0;

}
// Slower C++ solution:
#include<cstdio>

#include<cstring>

#include<cmath>

#include<map>

#include<algorithm>

#include <iostream>

using namespace std;

typedef long long LL;

int a[100000];

int main()

{

    int sx, sy, tx, ty;

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

    int x = tx-sx;

    int y = ty-sy;

    for(int i = 0;i < y;i++)

    {

        cout<<"U";

    }

    for(int i = 0;i < x;i++)

    {

        cout<<"R";

    }

    for(int i = 0;i < y;i++)

    {

        cout<<"D";

    }

    for(int i = 0;i < x;i++)

    {

        cout<<"L";

    }

    cout<<"L";

    for(int i = 0;i <= y;i++)

    {

        cout<<"U";

    }

    cout<<"R";

    for(int i = 0;i < x;i++)

    {

        cout<<"R";

    }

    cout<<"D";

    cout<<"R";

    for(int i = 0;i <= y;i++)

    {

        cout<<"D";

    }

    cout<<"L";

    for(int i = 0;i < x;i++)

    {

        cout<<"L";

    }

    cout<<"U";

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.180770026351182x):
#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <math.h>

#define INF 0x3f3f3f3f



char s[100];

typedef long long ll;



void step(int x, int y)

{

    for (int i = 0; i < y; ++i)

    {

        printf("U");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("R");

    }

    for (int i = 0; i < y; ++i)

    {

        printf("D");

    }

    for (int i = 0; i < x; ++i)

    {

        printf("L");

    }

}



int main()

{

    //freopen("C:\\Users\\tiger\\Desktop\\a.txt","r",stdin);

	int x1,y1;

    int x2,y2;

    while ( ~scanf("%d %d %d %d", &x1, &y1, &x2, &y2) )

    {

        int x = x2 - x1;

        int y = y2 - y1;

        step(x,y);

        printf("L");

        for (int i = 0; i <= y; ++i)

        {

            printf("U");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("R");

        }

        printf("D");

        printf("R");

        for (int i = 0; i <= y; ++i)

        {

            printf("D");

        }

        for (int i = 0; i <= x; ++i)

        {

            printf("L");

        }

        printf("U\n");

    }

	return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

	int x1,y1,x2,y2;

	cin>>x1>>y1>>x2>>y2;

	for(int i=1;i<=y2-y1;i++)

	cout<<"U";

	for(int i=1;i<=x2-x1;i++)

	cout<<"R";

	for(int i=1;i<=y2-y1;i++)

	cout<<"D";

	for(int i=1;i<=x2-x1+1;i++)

	cout<<"L";

	for(int i=1;i<=y2-y1+1;i++)

	cout<<"U";

	for(int i=1;i<=x2-x1+1;i++)

	cout<<"R";

	cout<<"D";

	cout<<"R";

	for(int i=1;i<=y2-y1+1;i++)

	cout<<"D";

	for(int i=1;i<=x2-x1+1;i++)

	cout<<"L";

	cout<<"U"<<endl;

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.159015587853519x):
#include <stdio.h>

#include <algorithm>

using namespace std;



int main()

{

    int sx,sy,tx,ty,i=0,a,b,c,d;

    char ch[20000];

    scanf("%d%d%d%d",&sx,&sy,&tx,&ty);

    a=sx,b=sy,c=tx,d=ty;

    for(;;)

    {

      if(b<d)

      {

         ch[i++]='U';

          b++;

      }

      else if(a<c)

      {

          ch[i++]='R';

          a++;

      }

      if(a==tx&&b==ty)break;

    }

    int j=i;a=sx-1,b=sy;

    ch[j++]='L';

    for(;;)

    {

        if(b<d+1)

        {

            ch[j++]='U';

            b++;

        }

        else if(a<c)

        {

            ch[j++]='R';

            a++;

        }

        if(a==c&&b==d+1)

            break;

    }

    ch[j++]='D';

    int x;

    for(x=0;x<i;x++)

        printf("%c",ch[x]);

    for(x=0;x<i;x++)

    {

        if(ch[x]=='U')printf("D");

        else printf("L");

    }

    for(x=i;x<j;x++)

    printf("%c",ch[x]);

    for(x=i;x<j;x++)

    {

        if(ch[x]=='L')printf("R");

        else if(ch[x]=='U')printf("D");

        else if(ch[x]=='R')printf("L");

        else printf("U");

    }

    printf("\n");

    return 0;

}