NOIP day1 玩具谜题

/*
CCF NOIP2016 day1
toy
*/

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;

int n,m,cmd1,cmd2,pt;
struct toy{
bool d;
char p[12];
};
toy f[100000+3];    //存玩具小人

int cshun(int pn, int num){
pn-=num;
if(pn<1) pn+=n;
return pn;
}

int cni(int pn, int num){
pn+=num;
if(pn>n) pn-=n;
return pn;
}

int main(){
scanf("%d%d",&n,&m);
int tmp;
for(int k=1;k<=n;k++){
scanf("%d %s",&tmp,&f[k].p);
f[k].d=tmp;
}

pt=1;
for(int k=1;k<=m;k++){
scanf("%d%d",&cmd1,&cmd2);

if(f[pt].d){  //1-> direction outside
if(cmd1) pt=cshun(pt,cmd2); //right hand
else     pt=cni(pt,cmd2); //left hand
}else{   //0-> direction inside
if(cmd1) pt=cni(pt,cmd2); //right hand
else     pt=cshun(pt,cmd2); //left hand
}

}

printf("%s",f[pt].p);
return 0;
}