#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;

struct Ant
{
    int st = 0;
    bool right = false;
    int diff = 0;
};

int main()
{
    int K;
    cin >> K;
    string S;
    cin >> S;
    int N, M;
    cin >> N >> M;
    vector<Ant> data(N);
    vector<int> diffs(N);
    for(int i=0;i<N;++i)
    {
        cin >> data[i].st >> data[i].right;
        if(data[i].right)
            data[i].diff = K+1-data[i].st;
        else
            data[i].diff = data[i].st;
        diffs[i] = data[i].diff;
    }
    nth_element(diffs.begin(),diffs.begin()+M-1,diffs.end());
    int distance = diffs[M-1];
    bool flg[2000001] = {};
    for(int i=0;i<N;++i)
    {
        if(data[i].diff>distance)
        {
            if(data[i].right)
                flg[data[i].st+distance-1] = true;
            else
                flg[data[i].st-distance-1] = true;
        }
    }
    for(int i=0;i<K;++i)
    {
        if(flg[i])
            cout << S[i];
    }
    return 0;
}