#pragma warning disable

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Runtime.Serialization.Formatters.Binary;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using System.Numerics;
using System.Collections;
using System.Timers;

static class MainClass
{
    public static void Main(string[] args)
    {
        var sstt = Console.ReadLine().SplittedStringToInt32List();
        var sx = sstt[0];
        var sy = sstt[1];
        var tx = sstt[2];
        var ty = sstt[3];

        var nowx = sx;
        var nowy = sy;
        var sb = new StringBuilder();
        var value = new StringBuilder();
        string dele, uele, lele, rele;

        while (true)
        {
            if (nowx == tx)
                break;
            nowx++;
            sb.Append("R");
        }
        rele = sb.ToString();
        value.Append(sb.ToString());
        sb.Clear();
        while (true)
        {
            if (nowy == ty)
                break;
            nowy++;
            sb.Append("U");
            
        }
        uele = sb.ToString();
        value.Append(sb.ToString());
        sb.Clear();
        while (true)
        {
            if (nowx == sx)
                break;
            sb.Append("L");
            nowx--;
        }
        lele = sb.ToString();
        value.Append(sb.ToString());
        sb.Clear();
        while (true)
        {
            if (nowy == sy)
                break;
            nowy--;
            sb.Append("D");
        }
        dele = sb.ToString();
        value.Append(sb.ToString());
        sb.Clear();
        value.Append("D").Append(rele).Append("R").Append("U").Append(uele).Append("L").Append("U").Append("L").Append(lele).Append("D").Append(dele).Append("R");
        Console.WriteLine(value.ToString());
        Console.ReadLine();
    }


    //public class Edge
    //{
    //    public int From;
    //    public int To;
    //    public int Cost;
    //}

    //public static List<KeyValuePair<int, int>> GetShortestPathes(int s, IEnumerable<Edge> edges, int vertices)
    //{
    //    var ls = new KeyValuePair<int, int>[vertices];

    //    return ls.ToList();
    //}


    #region ライブラリ

    #region 文字列処理

    public static int ToInt32(this string str) => int.Parse(str);
    public static BigInteger ToBigInteger(this string str) => BigInteger.Parse(str);
    public static List<string> SplittedStringToList(this string str) => str.Split(new[] { ' ' }, StringSplitOptions.RemoveEmptyEntries).ToList();
    public static List<int> SplittedStringToInt32List(this string str) => str.Split(new[] { ' ' }, StringSplitOptions.RemoveEmptyEntries).Select(x => int.Parse(x)).ToList();

    public static List<BigInteger> SplittedStringToBigInteger(this string str) => str.Split(new[] { ' ' }, StringSplitOptions.RemoveEmptyEntries).Select(x => BigInteger.Parse(x)).ToList();
    #endregion
    #region DeepClone
    public static T DeepClone<T>(this T src)
    {
        using (var memoryStream = new MemoryStream())
        {
            var binaryFormatter
              = new BinaryFormatter();
            binaryFormatter.Serialize(memoryStream, src);
            memoryStream.Seek(0, SeekOrigin.Begin);
            return (T)binaryFormatter.Deserialize(memoryStream);
        }
    }
    #endregion

    public static int Gcd(int a, int b)
    {
        if (b == 0)
            return a;
        return Gcd(b, a % b);
    }
    public static BigInteger Gcd(BigInteger a, BigInteger b)
    {
        if (b == 0)
            return a;
        return Gcd(b, a % b);
    }


    public static BigInteger Factorial(int n)
    {
        var dp = new BigInteger[n];
        dp[0] = 1;
        for (int i = 1; i < n; i++)
        {
            dp[i] = dp[i - 1] * (i + 1);
        }
        return dp[n - 1];
    }

    public static List<int> PrimeFactorize(int n)
    {
        var bases = n;
        var num = (int)Math.Pow(n, 0.5);
        var ls = new List<int>();
        for (int i = 2; i <= num; i++)
        {
            if (n % i == 0)
            {
                n = n / i;
                ls.Add(i);
                i--;
                continue;
            }
        }
        var nnn = 1;
        foreach (var item in ls)
        {
            nnn = nnn * item;
        }
        if (nnn != bases)
            ls.Add(n);
        return ls;
    }

    #endregion

}


Measured memory_bytes: 13364