#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <algorithm>
#include <ctime>
#include <set>
#include <vector>
#include <queue>
using namespace std;
const int MAXN = 100011;
int n,m,dir[MAXN];
char ch[MAXN][14];

void work(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++) {
        scanf("%d",&dir[i]);
        scanf("%s",ch[i]);
    }
    int x,y,ljh; x=1;
    while(m--) {
        scanf("%d%d",&ljh,&y);
        if(dir[x]==0) {
            if(ljh==0) {
                x+=n; x-=y;
                if(x>n) x%=n;
            }
            else{
                x+=y;
                if(x>n) x%=n;
            }
        }
        else{
            if(ljh==0) {
                x+=y;
                if(x>n) x%=n;
            }
            else{
                x+=n; x-=y;
                if(x>n) x%=n;
            }
        }
    }
    printf("%s",ch[x]);
}

int main()
{
	freopen("toya.in","r",stdin); 
    freopen("toya.out","w",stdout);
	work();
	fclose(stdin);fclose(stdout);
    return 0;    
}