#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
int n, m, nown, x, y;
struct toys
{
	int toward;
	string name;
}a[maxn];
int main()
{
	cin >> n >> m;
	for(int i = n - 1; i >= 0; i--)
	{
		cin >> a[i].toward >> a[i].name;
	}
	nown = n - 1;
	for(int i = 1; i <= m; i++)
	{
		cin >> x >> y;
		if(x == 0)
		{
			if(a[nown].toward == 0)
			{
				nown = (nown + y) % n;
			}
			else
			{
				nown = (nown - y + n) % n;
			}
		}
		else
		{
			if(x == 0)
			{
				nown = (nown - y + n) % n;
			}
			else
			{
				nown = (nown + y) % n;
			}
		}
	}
	cout << a[nown].name;
	return 0;
}