# include <bits/stdc++.h>
using namespace std;
mt19937 rand_Gen(44874577);
const int MAXN = 102;
int n,k,s,w,z,x,y;
int p[150000];
int a[55],b[55];
int prices[1005][1005];
int best[MAXN][MAXN][100];

int change;
struct pointss
{
    int x,y;
    pointss(int __x = 0, int __y = 0)
    {
        x = __x;
        y = __y;
    }
    friend pointss operator + (const pointss &A, const pointss &B)
    {
        return pointss(A.x+B.x,A.y+B.y);
    }
    friend bool operator == (const pointss &A, const pointss &B)
    {
        return (A.x==B.x && A.y==B.y);
    }
    friend bool operator < (const pointss &A, const pointss &B)
    {
        if(A.x==B.x)return A.y<B.y;
        return (A.x<B.x);
    }
};
pointss from[MAXN][MAXN][100];
pointss Z[4] = {pointss(-1,0),pointss(0,-1),pointss(1,0),pointss(0,1)};
bool correct(pointss A)
{
    if(A.x>0&&A.x<=n && A.y>0 && A.y<=n)return true;
    return false;
}
void change_place()
{
    int i;
    for(i = 1; i<=k; i++)
    {
        a[i] = (a[i]*w+z)%n+1;
        b[i] = (b[i]*z+w)%n+1;
    }
}
set <pointss > st;
vector <char> ans;
char T[4] = {'U','L','D','R'};
int cost(pointss A)
{
    long long mindist = 1e9,curr;
    int i;
    for(i = 1; i<=k; i++)
    {
        curr = (long long)(A.x-a[i])*(A.x-a[i]) + (long long)(A.y-b[i])*(A.y-b[i]);
        if(curr<mindist)mindist = curr;
    }
    mindist = sqrt(mindist);
    return p[mindist];
}
void calc_prices()
{
    int i,j;
    for(i=  1; i <= n; i++)
        for(j = 1; j <= n; j++)
        {
            prices[i][j] = cost(pointss(i,j));
        }
}
pointss calc_routes(int sz, int x, int y, int deltaX = 0, int deltaY = 0)
{
    x-=deltaX;
    y-=deltaY;
    int i,j,t,z;
    int k = n;
    int n = min(100,k);
    for(i=1; i<=n; i++)
        for(j=1; j<=n; j++)
        {
            if(i==x&&j==y)
                best[i][j][0] = prices[i+deltaX][j+deltaY];
            else
                best[i][j][0] = -1e9;
        }

    for(t = 1; t<=change; t++)
    {
        for(i =1; i<=n; i++)
            for(j= 1; j<=n; j++)
                best[i][j][t] = -1e9;

        for(i = 1; i <=n; i++)
        {
            for(j = 1; j <= n; j++)
            {
                //cout<<"( "<<i<<","<<j<<"): "<<t-1<<" "<<best[i][j][t-1]<<" : "<<from[i][j][t-1].x<<" "<<from[i][j][t-1].y<<endl;
                pointss curr = pointss(i,j);

                for(z= 0; z<4; z++)
                {
                    pointss news = curr+Z[z];
                    if(best[news.x][news.y][t] > best[curr.x][curr.y][t-1]+prices[news.x+deltaX][news.y+deltaY])continue;
                    if(!correct(pointss(news.x+deltaX,news.y+deltaY)))continue;
                    pointss d = curr;
                    bool fl = true;
                    for(int h = t-1; h>=1; h--)
                    {
                        d = from[d.x][d.y][h];
                        if(d==news)
                        {
                            fl =0;
                            break;
                        }
                    }
                    if(fl)
                    {
                        best[news.x][news.y][t] = best[curr.x][curr.y][t-1]+prices[news.x+deltaX][news.y+deltaY];
                        from[news.x][news.y][t]  = curr;
                    }
                    else
                    {
                        if(best[news.x][news.y][t]<best[curr.x][curr.y][t-1])
                        {
                            best[news.x][news.y][t] = best[curr.x][curr.y][t-1];
                            from[news.x][news.y][t]  = curr;
                        }
                    }
                }
            }
        }
    }

    long long BEST = 0;
    pointss W = pointss(x,y);
    for(i = 1; i<=n; i++)
        for(j = 1; j<=n; j++)
        {
            if(best[i][j][sz]>BEST)
            {
                BEST = best[i][j][sz];
                W = pointss(i,j);

            }
        }
    stack <pointss> st;
    //cout<<sz<<endl;
    //cout<<best[i][j][sz]<<" :::: "<<W.x<<" "<<W.y<<endl;
    for(i = sz; i > 0; i--)
    {
        st.push(pointss(W.x,W.y));
        W = from[W.x][W.y][i];
        // cout<<W.x<<" && "<<W.y<<endl;
    }
    W = pointss(x,y);
    while(!st.empty())
    {
        auto R = st.top();
        st.pop();
        //  cout<<R.x<<" "<<R.y<<"  --> "<<W.x<<" "<<W.y<<endl;
        if(R.x+1==W.x)ans.push_back('U');
        if(R.x-1==W.x)ans.push_back('D');
        if(R.y+1==W.y)ans.push_back('L');
        if(R.y-1==W.y)ans.push_back('R');
        W = R;
    }
    return W;
}
vector <pointss> curr_route;
vector <pointss> best_route;
int visited[1005][1005],ids;
long long curr_Ans, best_Ans = 0;
void find_best_route(pointss A, int turns)
{
    visited[A.x][A.y] = ids;
    if(turns == 0)
    {
        if(best_Ans < curr_Ans)
        {
            best_Ans = curr_Ans;
            best_route = curr_route;

        }
        return ;
    }
    int dir;
    while(1)
    {
        dir = rand_Gen()%4;
        if(!correct(A+Z[dir]))continue;
        auto news = A+Z[dir];
        if(visited[news.x][news.y]==ids)
        {
            if(rand_Gen()%3 > 0)continue;
        }
        break;
    }
    auto news = A+Z[dir];
        if(visited[news.x][news.y]!=ids)
        {
            curr_Ans += cost(news);
        }
        curr_route.push_back(news);
        find_best_route(news,turns-1);
        curr_route.pop_back();
}
char direction(pointss A, pointss B)
{
   // cout<<A.x<<" "<<A.y<<" --> "<<B.x<<" "<<B.y<<endl;
    if(A.x + 1 == B.x)return 'D';
    if(A.x - 1 == B.x)return 'U';
    if(A.y + 1 == B.y)return 'R';
    if(A.y - 1 == B.y)return 'L';
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    freopen("cleanUP.in","r",stdin);
 freopen("cleanUP.out","w",stdout);
    cin>>n>>k>>s>>w>>z>>x>>y;
    int alldist = sqrt(2)*(n-1);
    int i;
    //cout<<alldist<<endl;
    for(i = 0; i <= alldist; i++)
    {
        cin>>p[i];
    }
    for(i = 1; i<=k; i++)
    {
        cin>>a[i];
        cin>>b[i];
    }
    change = sqrt(s);
    // cout<<change<<endl;
    pointss curr = pointss(x,y);
    if(n<=100)
    {
        for(i = 1; i<=s; i+=change)
        {

            calc_prices();

            auto ffff = calc_routes(min(change,s-i+1),x,y);

            x = ffff.x;
            y = ffff.y;
            change_place();
            //           for(auto q:ans)
            //     cout<<q;
            // cout<<endl;
        }
    }
    else if(n<=1000)
    {
        for(i = 1; i <= s; i+=change)
        {
          //  calc_prices();
            best_Ans = -1e9;
            best_route.clear();
            for(int j = 1; j <= 50;j++)
            {
                 ids++;
                curr_Ans = 0;
                find_best_route(pointss(x,y),min(change,s-i+1));

            }
            pointss curr = pointss(x,y);
            for(auto W:best_route)
            {
                ans.push_back(direction(curr,W));
                curr = W;
            }
            x = curr.x;
            y=  curr.y;
            change_place();
        }
    }
    else
        for(int ff = 1; ff<=s; ff++)
        {
            // cout<<ff<<endl;
            if(ff%change==0)
            {
                st.clear();
                change_place();
            }
            int best = -1;
            int dir = 0;
            pointss news;
            for(i = 0; i<4; i++)
            {
                auto h = curr + Z[i];
                if(!correct(h))continue;
                int tek = 0;
                if(st.find(h)!=st.end())tek = 0;
                else
                    tek = cost(h);
                if(tek>best)
                {
                    best =  tek;
                    news = h;
                    dir = i;
                }
            }
            curr = news;
            ans.push_back(T[dir]);


        }

    for(auto q:ans)
    {

        /*if(q == 'L')q='U';
        else
          if(q=='R')q='D';
        else
          if(q=='D')q = 'R';
        else
          q='L';*/
        cout<<q;
    }

    cout<<endl;
    return 0;
}