#include<iostream>
#include<fstream>
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
ifstream fin("party.in");
ofstream fout("party.out");
int high[256][256];
int sweet[256][256];
struct party
{
    int x,y,start,time,enD,I;
};
vector<party>parties;
vector<int>sweets1,sweets2;
bool cmp(party a,party b)
{
    if (a.start<b.start)return 1;
    if (a.start>b.start)return 0;
    if (a.enD<b.enD)return 1;
    if (a.enD>b.enD)return 0;
    if (a.x<b.x)return 1;
    if (a.x>b.x)return 0;
    if (a.y<b.y)return 1;
    if (a.y>b.y)return 0;
    if (a.I<b.I)return 1;
    if (a.I>b.I)return 0;
    return 1;
}
int hhhh;
int different(int a,int b,int x,int y)
{
    //fout<<a<<" "<<b<<" "<<x<<" "<<y<<endl;
    int ans=0,ans2=0,i;
    if (a<x)
    for (i=a+1;i<=x;i++)
    {
        int help=abs(high[i][b]-high[i-1][b]);
        ans+=help*help;
    }
    else
    {
        for (i=a-1;i>=x;i--)
        {
            int help=abs(high[i][b]-high[i+1][b]);
            ans+=help*help;
        }
    }
    if (b<y)
    for (i=b+1;i<=y;i++)
    {
        int help=abs(high[x][i]-high[x][i-1]);
        ans+=help*help;
    }
    else
    {
        for (i=b-1;i>=y;i--)
        {
            int help=abs(high[x][i]-high[x][i+1]);
            ans+=help*help;
        }
    }
    if (b<y)
    for (i=b+1;i<=y;i++)
    {
        int help=abs(high[a][i]-high[a][i-1]);
        ans2+=help*help;
    }
    else
    {
        for (i=b-1;i>=y;i--)
        {
            int help=abs(high[a][i]-high[a][i+1]);
            ans2+=help*help;
        }
    }
    if (a<x)
    for (i=a+1;i<=x;i++)
    {
        int help=abs(high[i][y]-high[i-1][y]);
        ans2+=help*help;
    }
    else
    {
         for (i=a-1;i>=x;i--)
        {
            int help=abs(high[i][y]-high[i-1][y]);
            ans2+=help*help;
        }
    }
    //cout<<ans<<" "<<ans2<<endl;
    if (ans<ans2)
    {
        hhhh=0;
        return ans;
    }

    {
        hhhh=1;
        return ans2;
    }
}
void printroad(int a,int b,int x,int y,int num)
{
    //fout<<a<<" "<<b<<" "<<x<<" "<<y<<endl;
    int ans=0,ans2=0,i;
    if (num==0)
    {
        if (a<x)
        for (i=a+1;i<=x;i++)
        {
            fout<<"D";
        }
        else
        {
            for (i=a-1;i>=x;i--)
            {
                fout<<"U";
            }
        }
        if (b<y)
        for (i=b+1;i<=y;i++)
        {
            fout<<"R";
        }
        else
        {
            for (i=b-1;i>=y;i--)fout<<"L";
        }
        return ;
    }
    if (b<y)
    for (i=b+1;i<=y;i++)
    {
        int help=abs(high[a][i]-high[a][i-1]);
        ans2+=help*help;
        fout<<"R";
    }
    else
    {
        for (i=b-1;i>=y;i--)
        {
            int help=abs(high[a][i]-high[a][i+1]);
            ans2+=help*help;
            fout<<"L";
        }
    }
    if (a<x)
    for (i=a+1;i<=x;i++)
    {
        int help=abs(high[i][y]-high[i-1][y]);
        ans2+=help*help;
        fout<<"D";
    }
    else
    {
         for (i=a-1;i>=x;i--)
         {
             int help=abs(high[i][y]-high[i-1][y]);
             ans2+=help*help;
             fout<<"U";
         }
    }
}
int main()
{
    int n,p,k;
    fin>>n>>p>>k;
    int i,j;
    for (i=1;i<=n;i++)
    {
        for (j=1;j<=n;j++)fin>>high[i][j];
    }
    int a,b;
    fin>>a>>b;
    for (i=0;i<p;i++)
    {
        party help;
        help.I=i;
        int x,y,start,time,enD;
        fin>>help.x>>help.y>>help.start>>help.time;
        help.enD=help.start+help.time;
        parties.push_back(help);
    }
    for (i=0;i<k;i++)
    {
        int x,y;
        fin>>x>>y;
        sweet[x][y]=1;
        sweets1.push_back(x);
        sweets2.push_back(y);
    }
    sort(parties.begin(),parties.end(),cmp);
    /*for (i=1;i<=n;i++)
    {
        for (j=1;j<=n;j++)
        {
            fout<<high[i][j]<<" ";
        }
        fout<<endl;
    }
    fout<<endl;
    for (i=1;i<=n;i++)
    {
        for (j=1;j<=n;j++)
        {
            fout<<sweet[i][j]<<" ";
        }
        fout<<endl;
    }
    fout<<endl;
    for (i=0;i<p;i++)
    {
        fout<<parties[i].x<<" "<<parties[i].y<<" "<<parties[i].start<<" "<<parties[i].time<<" "<<parties[i].enD<<" "<<parties[i].I<<endl;
    }
    */
    int mint=1<<30,I,ch;
    for (i=0;i<k;i++)
    {
        int help=different(a,b,sweets1[i],sweets2[i]);
        //cout<<help<<"is help["<<i<<"]"<<endl;
        if (help<mint)
        {
            mint=help;
            I=i;
            ch=hhhh;
        }
    }
    //cout<<mint<<" "<<I<<" "<<ch<<endl;
    int raz=mint;
    //cout<<raz<<endl;
    //printroad(a,b,sweets1[I],sweets2[I],ch);
    //a=sweets1[I];
    //b=sweets2[I];
    raz=0;
    //fout<<endl<<a<<" "<<b<<endl;
    for (i=0;i<p;i++)
    {
        //fout<<a<<" "<<b<<" "<<parties[i].x<<" "<<parties[i].y<<" "<<parties[i].start<<" "<<parties[i].enD<<" ";
        int help=different(a,b,parties[i].x,parties[i].y);
        //fout<<help+raz<<endl;
        if (help+raz<=parties[i].start)
        {
            //fout<<a<<" "<<b<<" "<<parties[i].x<<" "<<parties[i].y<<endl;
            printroad(a,b,parties[i].x,parties[i].y,hhhh);fout<<"+";
            a=parties[i].x;
            b=parties[i].y;
            raz+=help;
            if (parties[i].enD>raz)raz=parties[i].enD;
        }
    }
    fout<<endl;
}