#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=100015;
int n,m,a1,b1,b2;
struct toy{
	bool dir;
	string name;
}t[maxn];
string str[maxn],a2;
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>a1>>a2;
		t[i].dir=a1;t[i].name=a2;//1外0内 
	}
	int now=1;
	for(int i=1;i<=m;i++){
		cin>>b1>>b2;
		if(b1==0){//向右 
			if(t[now].dir==1){
				now+=b2;
				if(now>n){
					now-=n;
				}
			}
			else{
				now-=b2;
				if(now<0){
					now+=n;
				}
			}
		}
		else{//向左 
			if(t[now].dir==0){
				now+=b2;
				if(now>n){
					now-=n;
				}
			}
			else{
				now-=b2;
				if(now<0){
					now+=n;
				}
			}
		}
	}
	cout<<t[now].name<<endl;
	return 0;
}

测试点：

输入：

20 1000
0 libvpmvqve
1 mcchv
0 iu
0 plqgmf
1 tsioh
1 jijhtqsqi
0 nj
0 kkwqmmxi
1 davzufmuzc
1 nzurnhlvy
1 ujcmhw
0 vrsffibh
1 zc
0 ellkuo
1 kzwtliip
1 zckc
1 j
1 fcylevprn
1 cetoo
1 qvkuwhfumb
0 1
0 1
1 1
1 1
1 1
0 1
1 1
0 1
0 1
0 1
1 1
1 1
0 1
1 1
0 1
0 1
0 1
1 1
0 1
1 1
0 1
0 1
0 1
1 1
1 1
1 1
1 1
1 1
1 1
0 1
1 1
1 1
1 1
1 1
1 1
0 1
1 1
0 1
1 1
1 1
1 1
0 1
1 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
0 1
1 1
1 1
0 1
0 1
1 1
0 1
1 1
0 1
1 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
1 1
0 1
1 1
1 1
0 1
1 1
1 1
0 1
0 1
0 1
0 1
1 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
1 1
1 1
0 1
0 1
1 1
0 1
0 1
1 1
1 1
0 1
0 1
1 1
1 1
1 1
1 1
0 1
1 1
1 1
1 1
0 1
1 1
0 1
1 1
0 1
0 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
1 1
1 1
0 1
1 1
1 1
0 1
0 1
0 1
0 1
0 1
0 1
0 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
1 1
0 1
0 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
0 1
0 1
1 1
1 1
1 1
1 1
0 1
1 1
0 1
0 1
0 1
0 1
0 1
1 1
0 1
1 1
0 1
1 1
1 1
1 1
0 1
1 1
1 1
1 1
1 1
0 1
0 1
1 1
0 1
0 1
1 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
1 1
1 1
1 1
1 1
0 1
1 1
1 1
0 1
1 1
0 1
1 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
0 1
0 1
0 1
0 1
0 1
1 1
0 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
1 1
0 1
0 1
0 1
0 1
0 1
0 1
1 1
1 1
0 1
1 1
0 1
0 1
1 1
0 1
1 1
1 1
1 1
1 1
1 1
0 1
1 1
1 1
1 1
0 1
0 1
0 1
1 1
1 1
1 1
1 1
0 1
0 1
0 1
0 1
0 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
0 1
0 1
0 1
1 1
0 1
0 1
1 1
0 1
1 1
1 1
0 1
0 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
0 1
0 1
0 1
1 1
0 1
0 1
1 1
1 1
0 1
1 1
0 1
0 1
0 1
0 1
0 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
0 1
1 1
1 1
0 1
0 1
0 1
1 1
0 1
0 1
0 1
1 1
1 1
0 1
0 1
1 1
0 1
1 1
1 1
1 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
0 1
0 1
0 1
1 1
0 1
1 1
0 1
1 1
0 1
0 1
0 1
1 1
0 1
0 1
1 1
0 1
1 1
1 1
0 1
0 1
0 1
0 1
1 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
0 1
0 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
1 1
1 1
0 1
0 1
0 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
0 1
0 1
0 1
1 1
1 1
0 1
1 1
0 1
1 1
0 1
0 1
1 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
0 1
1 1
0 1
0 1
0 1
1 1
0 1
1 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
0 1
1 1
0 1
1 1
1 1
1 1
1 1
0 1
1 1
1 1
0 1
0 1
0 1
0 1
0 1
1 1
0 1
1 1
0 1
1 1
1 1
0 1
1 1
1 1
1 1
1 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
1 1
1 1
1 1
0 1
1 1
0 1
1 1
0 1
1 1
0 1
1 1
0 1
1 1
0 1
1 1
0 1
1 1
0 1
1 1
1 1
0 1
1 1
1 1
1 1
0 1
1 1
1 1
0 1
1 1
1 1
0 1
1 1
1 1
0 1
0 1
0 1
1 1
1 1
1 1
1 1
0 1
0 1
1 1
0 1
1 1
1 1
0 1
1 1
1 1
0 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
0 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
0 1
1 1
0 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
1 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
1 1
1 1
0 1
1 1
1 1
0 1
0 1
0 1
1 1
0 1
0 1
0 1
1 1
0 1
1 1
0 1
1 1
1 1
1 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
1 1
0 1
0 1
1 1
1 1
1 1
1 1
1 1
0 1
0 1
1 1
1 1
0 1
1 1
1 1
0 1
1 1
0 1
0 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
1 1
1 1
0 1
1 1
0 1
0 1
0 1
1 1
1 1
0 1
0 1
0 1
0 1
0 1
1 1
0 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
1 1
0 1
1 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
1 1
1 1
1 1
1 1
0 1
1 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
0 1
0 1
0 1
1 1
1 1
0 1
1 1
0 1
1 1
0 1
0 1
1 1
1 1
0 1
0 1
0 1
1 1
1 1
1 1
1 1
0 1
1 1
0 1
0 1
1 1
0 1
1 1
0 1
1 1
1 1
1 1
1 1
1 1
1 1
1 1
0 1
1 1
1 1
0 1
0 1
1 1
0 1
1 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
1 1
0 1
0 1
0 1
0 1
0 1
1 1
0 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
1 1
1 1
1 1
1 1
0 1
1 1
0 1
0 1
1 1
1 1
0 1
1 1
0 1
0 1
1 1
1 1
0 1
0 1
0 1
1 1
1 1
0 1
0 1
1 1
1 1
0 1
1 1
0 1
0 1
1 1
1 1
0 1
0 1
1 1
1 1
1 1
1 1
1 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
1 1
0 1
0 1
0 1
0 1
1 1
1 1
0 1
0 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
1 1
1 1
0 1
1 1
1 1
0 1
0 1
0 1
1 1
0 1
1 1
0 1
1 1
1 1
0 1
0 1
0 1
0 1
1 1
1 1
0 1
1 1
0 1
1 1
0 1
1 1
0 1
1 1
1 1
0 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
1 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
1 1
1 1
0 1
0 1
1 1
1 1
0 1
0 1
1 1
0 1
1 1
1 1
1 1
0 1
0 1
0 1
0 1
0 1
1 1
1 1
0 1
0 1
0 1
0 1
0 1
0 1
0 1
1 1
1 1
0 1
0 1
1 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
1 1
0 1
1 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
1 1
0 1
1 1
1 1
1 1
1 1
0 1
1 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
1 1
1 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
0 1
1 1
1 1
1 1
1 1
1 1
1 1
0 1
1 1
0 1
1 1
1 1
0 1
1 1
1 1
0 1
1 1
1 1
1 1
1 1
0 1
0 1
1 1
1 1
0 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
0 1
0 1
0 1
0 1
1 1
0 1
0 1
1 1
1 1
1 1
1 1
0 1
0 1
1 1
1 1
0 1
0 1
1 1
0 1
0 1
0 1
1 1
0 1
0 1
1 1
1 1
0 1
0 1
0 1
1 1
0 1
0 1
1 1
0 1
0 1
1 1
1 1
1 1
0 1
0 1
1 1
1 1
0 1
0 1

输出：

libvpmvqve