/*
int      %o/%lo(八进制) %d/%i/%ld/%li(十进制) %x/%lx(十六进制)[如标名为o/lo/d/i/lo/li/x/lx即输出为八进制/十进制/十六进制]
longlong %lld
float    %f/%e
double   %lf/%le
char     %c
char[]   %s
'a'=97
'z'=122
'A'=65
'Z'=90
'0'=48
'9'=57
*/
#include <iostream>
#include <iomanip>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define LL long long
const int N=1e5+10;
const int INF=0x3f3f3f3f;
const double pi=3.1416;
int n,m,x,y,cnt=1;
struct sb
{
	int fx;
	string name;
} a[N];

int main()
{
	cin>>n>>m;
	for(int i=1; i<=n; i++)
	{
		cin>>a[i].fx>>a[i].name;
	}
	while(m--)
	{
		cin>>x>>y;
		if(a[cnt].fx==0&&x==0||(a[cnt].fx==1&&x==1))
		{
			cnt=cnt-y;
		}
		else
		{
			cnt=cnt+y;
		}
		while(cnt<=0)
		{
			cnt+=n;
		}
		cnt=(cnt-1)%n+1;
	}
	cout<<a[cnt].name;
	return 0;
}