#include<bits/stdc++.h>
using namespace std;
struct kid{
	bool dir;
	string job;
};
vector <kid> kids;
vector <int> ins;
int main()
{
	int n, m, ask = 0;
	scanf("%d%d", &n, &m);
	for(int i = 0; i < n; i++)
	{
		struct kid kk;
		cin >> kk.dir >> kk.job;
		kids.push_back(kk);
	}
	reverse(kids.begin()+1,kids.end());
	/*for(int i = 0; i < n; i++)
	{
		cout << kids[i].dir << kids[i].job;
	}*/
	for(int i = 0; i <2 * m; i++)
	{
		int x;
		cin >> x;
	ins.push_back(x);
	}
	/*for(int i = 0; i <2 * m; i++)
	{
		cout << ins[i];
	}*/
	
	int d = 0;
	for(int i = 0; i < m; i++)
	{
		if((ins[2*i] + kids[d].dir)%2 == 0)
		ask += ins[2*i + 1];
		else
		ask -= ins[2*i + 1];
		ask %= n;
		d = ask;
	}
	cout << kids[ask].job;
	
}