#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
struct toy_man
{
	int towards;
	string job;
}a[MAXN];
int main()
{
	//freopen(".in", "r", stdin);
	//freopen(".out", "w", stdout);
	int n, m, direction, number, cnt = 1;
	cin >> n >> m;
	for(int i = 1; i <= n; i ++)
		cin >> a[i].towards >> a[i].job;
	for(int i = 1; i <= m; i ++)
	{
		cin >> direction >> number;
		if(direction == 0 && a[cnt].towards == 0)
		{
			for(int i = 1; i <= number; i ++)
			{
				cnt -= 1;
				if(cnt < 1)
					cnt = n;
			}
		}
		else if(direction == 0 && a[cnt].towards == 1)
		{
			for(int i = 1; i <= number; i ++)
			{
				cnt += 1;
				if(cnt > 7)
					cnt = 1;
			}
		}
		else if(direction == 1 && a[cnt].towards == 0)
		{
			for(int i = 1; i <= number; i ++)
			{
				cnt += 1;
				if(cnt > 7)
					cnt = 1;
			}
		}
		else
		{
			for(int i = 1; i <= number; i ++)
			{
				cnt -= 1;
				if(cnt < 1)
					cnt = n;
			}
		}
	}
	cout << a[cnt].job;
	return 0;
}