#include<bits/stdc++.h>
using namespace std;

long long n, m, k, q;

bool have[1'004][1'004];
long long dp[1'004][1'004][2];
int main ()
{
    freopen("feetJ.in", "r", stdin);
    freopen("feetJ.out", "w", stdout);

    cin>>n>>m>>k>>q;
    for (long long i=0; i<q; i++)
    {
        long long x, y;
        cin>>x>>y;
        have[x][y]=1;
    }

    dp[n][m][have[n][m]]=1;
    //cout<<n<<" "<<m<<" "<<have[n][m]<<endl;
    for (long long i=n; i>=1; i--)
    {
        for (long long j=m; j>=1; j--)
        {
            if (i==n && j==m) continue;
            //cout<<i<<" "<<j<<endl;
            if (have[i][j])
            {
                dp[i][j][1]=min(dp[i][j+1][0]+dp[i+1][j][0], k+1);

            }
            else
            {
                dp[i][j][0]=min(dp[i][j+1][0]+dp[i+1][j][0], k+1);
                dp[i][j][1]=min(dp[i][j+1][1]+dp[i+1][j][1], k+1);
            }
        }
    }


    string ans;
    long long x=1;
    long long y=1;

    bool iz=0;

    while (x!=n || y!=m)
    {
        iz=max(have[x][y], iz);

        if (dp[x+1][y][!iz]<k)
        {
            k-=dp[x+1][y][!iz];
            ans.push_back('R');
            y++;
        }
        else
        {
            ans.push_back('D');
            x++;
        }
    }

    cout<<ans<<endl;
}