#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll n,m;
struct node1{
	string name;
	bool fx;
};
node1 a[100005];
ll x,y,cnt=1;
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i].fx>>a[i].name;
	while(m>0){
		cin>>x>>y;
		if(a[cnt].fx==0){
			if(x==0) cnt=(cnt-y+n)%n;
			else cnt=(cnt+y)%n;
		}else{
			if(x==0) cnt=(cnt+y)%n;
			else cnt=(cnt-y+n)%n;
		}
		m--;
	}
	cout<<a[cnt].name;
	return 0;
}