#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=100005;
int n,m,ans,dire,num;
struct node{
    bool face;
    string na; 
}pre[N];
int main()
{
	freopen("toya.in","r",stdin);
	freopen("toya.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
     cin>>pre[i].face>>pre[i].na;
    ans=1;
        for(int i=1;i<=m;i++)
    {
        cin>>dire>>num;
        if(pre[ans].face) dire=1-dire;
        if(dire==0) 
        {
            ans-=num;
            if(ans<=0) ans+=n;
        }
        else
        {
            ans+=num;
            if(ans>n) ans-=n;
        }
    }
    cout<<pre[ans].na<<endl;
    return 0;
}