95分,#4WA
#include <iostream>
#include <string>
using namespace std;
int toy_num,command_num;
string toys_name[100005];
int commands[100005];
bool toys_inside_outside[100005];
bool commands_left_right[100005];
void input(){
cin >> toy_num >> command_num;
for(int i = 1; i <= toy_num; i++){
cin >> toys_inside_outside[i] >> toys_name[i];
}
for(int i = 1; i <= command_num; i++){
cin >> commands_left_right[i] >> commands[i];
}
}
int visit_toy = 1;
void solve(){
for(int i = 1; i <= command_num; i++){
if(commands_left_right[i] == 0){
if(toys_inside_outside[visit_toy] == 0){
if(visit_toy - commands[i] >= 0)visit_toy = visit_toy - commands[i];
else visit_toy = toy_num + visit_toy - commands[i];
}
else{
if(visit_toy + commands[i] <= toy_num)visit_toy = visit_toy + commands[i];
else visit_toy = visit_toy + commands[i] - toy_num;
}
}
else{
if(toys_inside_outside[visit_toy] == 1){
if(visit_toy - commands[i] > 0)visit_toy = visit_toy - commands[i];
else visit_toy = toy_num + visit_toy - commands[i];
}
else{
if(visit_toy + commands[i] <= toy_num)visit_toy = visit_toy + commands[i];
else visit_toy = visit_toy + commands[i] - toy_num;
}
}
}
}
int main(){
input();
solve();
cout << toys_name[visit_toy] << endl;
return 0;
}