#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#define int long long
#define ture true
using namespace std;
struct node
{
	int k;
	string name;
};
signed main()
{
	node q[100010]; 
	int n,m,a,b;
	int sum=1;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>q[i].k;
		cin>>q[i].name;	
	} 
	for(int i=1;i<=m;i++)
	{
		cin>>a;
		cin>>b;
		if(q[i].k==0)
		{
			if(a==0)
			{
				sum=(sum+n-b)%n;
			}
			else
			{
				sum=(sum+b)%n;
			}
			//cout<<sum<<endl;
		}
		else if(q[i].k==1)
		{
			if(a==0)
			{
				sum=(sum+b)%n;
			}
			else if(a==1)
			{
				sum=(sum+n-b)%n;
			}
			//cout<<sum<<endl;
		}
	}
	cout<<q[sum].name;
	return 0;
}

样例过不了但交了有60分，求大佬帮忙看看