#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<string>
#define N 100005
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
#define ll long long
#define ul unsigned long long
#define int long long
using namespace std;
int n,m,t[N],now,x,y;
string s[N];
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x<y?x:y;}
int min(int x,int y){return x<y?x:y;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("toya.in","r",stdin);freopen("toya.out","w",stdout);
	ios::sync_with_stdio(0);
	cin>>n>>m;
	fo(i,0,n-1)cin>>t[i]>>s[i];
	while(m--)
	{
		cin>>x>>y;x^=t[now];
		if(x)now+=y;
		else now-=y;
		if(now<0)now+=n;
		if(now>=n)now-=n;
	}
	cout<<s[now];
	return 0;
}