#include using namespace std; const int N = 1e5 + 10; const int INF = 0X3f3f3f;

struct node { bool id; string name; }a[N];

int n , m , x , y , pos = 1; int main(){ cin >> n >> m; for(int i = 1; i <= n; i++) cin >> a[i].id >> a[i].name;

while(m--)
{
	cin >> x >> y;
	if( !a[pos].id && x || a[pos].id && !x )
	    pos += y;
	else
	    pos -= y;
	while( pos <= 0) pos += n;
	pos = (pos - 1) % n + 1;	    
}   
cout << a[pos].name;





return 0;

}