#include <algorithm>
#include <iostream>
#include <assert.h>
#include <fstream>
#include <time.h>
#include <vector>
#include <random>
#include <cmath>
#include <set>

using namespace std;

mt19937 rnd(22);
const int MAXN = 1e5;

int n, k, s, w, z, startX, startY;

int p[MAXN*2];
vector <pair <int, int>>* blackHoles[MAXN+5];

void readAndInit()
{
    #ifndef _LOCAL_
    ifstream cin("cleanUP.in");
    ofstream cout("cleanUP.out");
    #endif

    cin >> n >> k >> s >> w >> z >> startX >> startY;
    for(int i = 0;i<=(int)floor((n-1)*sqrt(2)+0.0001);i++) cin >> p[i];

    vector <pair <int, int>> *currHoles = new vector<pair <int, int>>();
    for(int i = 0;i<k;i++)
    {
        int a, b;
        cin >> a >> b;

        currHoles->emplace_back(a, b);
    }

    int period = floor(sqrt(s));
    for(int i = 0;i<s;i++)
    {
        if(i%period==period-1)
        {
            vector <pair <int, int>> *newHoles = new vector <pair <int, int>>(k);
            for(int j = 0;j<k;j++)
            {
                (*newHoles)[j].first = ((*currHoles)[j].first*1LL*w+z)%n + 1;
                (*newHoles)[j].second = ((*currHoles)[j].second*1LL*z+w)%n + 1;
            }

            currHoles = newHoles;
        }

        blackHoles[i] = currHoles;
    }
}

int getScore(int x, int y, int second)
{
    int D = MAXN*2;
    for(int i = 0;i<k;i++)
    {
        int d = floor(sqrt(((*blackHoles[second])[i].first - x)*1LL*((*blackHoles[second])[i].first - x) +
                           ((*blackHoles[second])[i].second - y)*1LL*((*blackHoles[second])[i].second - y)));

        D = min(D, d);
    }

    return p[D];
}

pair <int, int> movePos(pair <int, int> pos, char c)
{
    if(c=='L') pos.second--;
    else if(c=='R') pos.second++;
    else if(c=='U') pos.first--;
    else if(c=='D') pos.first++;
    else assert(false);

    return pos;
}

bool isInside(pair <int, int> pos)
{
    return ((1<=pos.first && pos.first<=n) && (1<=pos.second && pos.second<=n));
}

int64_t eval(const string& s)
{
    pair <int, int> curr = {startX, startY};
    set <pair <int, int>> used = {curr};

    int64_t score = getScore(curr.first, curr.second, 0);
    for(int second = 0;second<s.size();second++)
    {
        curr = movePos(curr, s[second]);

        if(isInside(curr)==false)
            return -1;
        if(used.count(curr)==false)
        {
            used.insert(curr);
            int64_t currScore = getScore(curr.first, curr.second, second);

            if(currScore<0) return -1;
            score += currScore;
        }
    }

    return score;
}

int64_t eval(const vector <char>& s)
{
    pair <int, int> curr = {startX, startY};
    set <pair <int, int>> used = {curr};

    int64_t score = getScore(curr.first, curr.second, 0);
    for(int second = 0;second<s.size();second++)
    {
        curr = movePos(curr, s[second]);
        if(used.count(curr)==false)
        {
            used.insert(curr);
            score += getScore(curr.first, curr.second, second);
        }
    }

    return score;
}

void genRandom(vector <char> &v)
{
    char moves[] = {'L', 'R', 'U', 'D'};
    pair <int, int> pos = {startX, startY};

    for(int i = 0;i<s;i++)
    {
        shuffle(moves, moves+4, rnd);

        for(int j = 0;j<4;j++)
        {
            pair <int, int> newPos = movePos(pos, moves[j]);
            if(isInside(newPos)==true)
            {
                v[i] = moves[j];
                pos = newPos;

                break;
            }
        }
    }
}

int main()
{
    #ifndef _LOCAL_
    ifstream cin("cleanUP.in");
    ofstream cout("cleanUP.out");
    #endif

    readAndInit();

    vector <char> ans;
    int64_t bestAnsScore = -100;

    vector <char> test(s);
    double startTime = clock();
    while((clock()-startTime)/CLOCKS_PER_SEC<4.6)
    {
        genRandom(test);
        int64_t score = eval(test);

        if(score>bestAnsScore)
        {
            bestAnsScore = score;
            ans = test;
        }
    }

    for(int i = 0;i<s;i++) cout << ans[i];
    cout << '\n';

    cerr << bestAnsScore << '\n';
}