#include<bits/stdc++.h>
using namespace std;
struct ren {
	string name;
	int dir;
} p[1000086];

int main() {
	int n,m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> p[i].dir >> p[i].name;
	}
	int x = 1;
	int l,r;
	for (int i = 1; i <= m; i++) {
		cin >> l >> r;
		if (p[x].dir == 0 && l == 0){
			x = (x + n - r) % n;
		}
		else if(p[x].dir == 0 && l == 1){
			x = (x + r) % n;
		}
		else if (p[x].dir == 1 && l == 0){
			x = (x + r) % n;
		}
		else if (p[x].dir == 1 && l == 1){
			x = (x + n - r) % n;
		}
		
	}
	cout << p[x].name << endl;
	//add=0 up
	//add=2 up
	//add=1 down




	return 0;
}