#include<iostream>
#include<vector>
#include<queue>
#include<fstream>
#include<algorithm>
#include<cmath>
#include<ctime>
#include<string>
using namespace std;
ofstream fout("party.out");
ifstream fin("party.in");
clock_t tm1,tm2;
float vr;
struct st
{
    int x,y,z;
    string path;
};
struct party
{
    int x,y;
    long long int n,k,p;
};
struct Comp
{
    bool operator()(const st& a,const st& b)
    {
        return a.z>b.z;
    }
};
bool cmp(party x,party y)
{
    if(x.n<y.n)return true;
    if(x.n>y.n)return false;
    if(x.k<y.k)return true;
    return false;
}
long long int razt(int x,int y,int cakes)
{
    return (abs(x-y)+cakes)*(abs(x-y)+cakes)+1;
}
priority_queue <st,vector<st>,Comp> pq;
int a[256][256];
long long int r[256][256];
int d[256][256];
party b[131072];
string path[256][256];
st c[256];
int n,p,k;
st s,nach;
long long int mxpts=0;
string mxpath;
void input()
{
    fin>>n>>p>>k;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            fin>>a[i][j];
        }
    }
    fin>>nach.x>>nach.y;
    for(int i=1;i<=p;i++)
    {
        fin>>b[i].x>>b[i].y>>b[i].n>>b[i].p;
        b[i].k=b[i].n+b[i].p;
        d[b[i].x][b[i].y]=1;
    }
    for(int i=1;i<=k;i++)
    {
        fin>>c[i].x>>c[i].y;
        d[c[i].x][c[i].y]=2;
    }
    sort(b+1,b+1+p,cmp);
   /* for(int i=1;i<=p;i++)
    {
        fout<<b[i].n<<" "<<b[i].p<<endl;

    }*/
}
void djikstra(int x,int y,int cakes)
{
    string pt="";
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            r[i][j]=999999999999999;
        }
    }
    r[x][y]=0;
    s.x=x;
    s.y=y;
    s.z=0;
    s.path=pt;
    path[x][y]="";
    pq.push(s);
    long long int q;
    while(!pq.empty())
    {
        tm2=clock()-tm1;
        vr=(float)tm2/CLOCKS_PER_SEC;
        if(vr>4.5)return;
        s=pq.top();
        x=s.x;
        y=s.y;
        pt=s.path;
        pq.pop();

        if(y+1<=n)
        {
            q=razt(a[x][y],a[x][y+1],cakes);
     //   fout<<q<<endl;
            if(r[x][y+1]>q+r[x][y])
            {
                r[x][y+1]=q+r[x][y];
                s.x=x;
                s.y=y+1;
                s.z=r[x][y+1];
                s.path=pt+'R';
                path[s.x][s.y]=s.path;
                pq.push(s);
            }
        }
        if(y-1>=1)
        {
            q=razt(a[x][y],a[x][y-1],cakes);
            if(r[x][y-1]>q+r[x][y])
            {
                r[x][y-1]=q+r[x][y];
                s.x=x;
                s.y=y-1;
                s.z=r[x][y-1];
                s.path=pt+'L';
                path[s.x][s.y]=s.path;
                pq.push(s);
            }
        }

        if(x-1>=1)
        {
            q=razt(a[x][y],a[x-1][y],cakes);
            if(r[x-1][y]>q+r[x][y])
            {
                r[x-1][y]=q+r[x][y];
                s.x=x-1;
                s.y=y;
                s.z=r[x-1][y];
                s.path=pt+'U';
                path[s.x][s.y]=s.path;
                pq.push(s);
            }
        }
        if(x+1<=n)
        {
            q=razt(a[x][y],a[x+1][y],cakes);
            if(r[x+1][y]>q+r[x][y])
            {
                r[x+1][y]=q+r[x][y];
                s.x=x+1;
                s.y=y;
                s.z=r[x+1][y];
                s.path=pt+'D';
                path[s.x][s.y]=s.path;
                pq.push(s);
            }
        }

    }
    /*for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            fout<<r[i][j]<<" ";
        }fout<<endl;
    }
    fout<<endl;*/
}
void f1()
{
    s=nach;
    long long int points=0,tm=0;
    int pr=1;
    string pyt="";
    while(1)
    {
        tm2=clock()-tm1;
        vr=(float)tm2/CLOCKS_PER_SEC;
        if(vr>4.5)break;
        //fout<<pr<<endl;
        if(pr>p)break;
        djikstra(s.x,s.y,0);
        tm2=clock()-tm1;
        vr=(float)tm2/CLOCKS_PER_SEC;
        if(vr>4.5)break;
        for(;pr<=p;pr++)
        {//fout<<pr<<endl;
           //     fout<<r[b[pr].x][b[pr].y]<<" "<<tm<<endl;
            if(r[b[pr].x][b[pr].y]+tm<b[pr].k)
            {
                s.x=b[pr].x;
                s.y=b[pr].y;
                tm=b[pr].k;

                //fout<<tm<<endl;
                pyt+=path[b[pr].x][b[pr].y];
                pyt+='+';
                //points+=b[pr].p;
                //cout<<b[pr].n<<endl;
               /// points+=b[pr].k-b[pr].n;
               // cout<<b[pr].n<<" "<<b[pr].k<<" "<<b[pr].p<<endl;
                //cout<<points<<endl;
               // pr++;
                break;
            }
        }
        //break;
    }
   // fout<<points<<endl;
    if(points>=mxpts)
    {
        mxpts=points;
        mxpath=pyt;
    }
}
int main()
{
    tm1=clock();
   // tm2=clock()-tm1;
    //vr=(float)tm2/CLOCKS_PER_SEC;
    input();
    /*for(int i=1;i<=p;i++)
    {
        fout<<b[i].x<<" "<<b[i].y<<" "<<b[i].n<<" "<<b[i].p<<endl;
    }*/
    f1();
//djikstra(1,1,0);

//fout<<path[1][5]<<endl;
    fout<<mxpath<<endl;
    return 0;
}