#include <iostream>
using namespace std;
typedef pair<int, string> PII;
const int N = 100010;
int n, m;
PII p[N];
int main()
{
scanf("%d%d", &n, &m);
for (int i = 0; i < n; i ++ ) cin >> p[i].first >> p[i].second;
int idx = 0;//记录位置的索引下标
while (m -- )
{
int a, b;
cin >> a >> b;
if (a == 0) //左数
{
if (p[idx].first == 0) idx = (idx - b + n) % n;//朝内
else idx = (idx + b) % n;
}
else //右数
{
if (p[idx].first == 0) idx = (idx + b) % n;//朝内
else idx = (idx - b + n) % n;
}
}
cout << p[idx].second << endl;
return 0;
}