似乎WA了好多。。QAQ为什么

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
using std::string;
using std::cout;
using std::cin;
using std::max;
using std::min;
#define repi(i,a,b) for(int i=a;i<=b;i++)
#define repd(i,a,b) for(int i=a;i>=b;i--)
#define dg(x) cout<<#x<<'='<<x<<' '
#define _end printf("\n")
#define show_merory(x) cout<<#x<<':'<<sizeof(x)/(1024.0*1024.0)<<"Mb\n"
#define ll long long
const int N=10000+10;
int n,m;
char name[N][20];
int toward[N],zlto[N],zlnm[N];
int main(){
    //freopen("toy.in","r",stdin);
//    freopen("toy.out","w",stdout);
    scanf("%d%d",&n,&m);
    repi(i,0,n-1){
        scanf("%d %s",&toward[i],&name[i]);
    }
    repi(i,1,m){
        scanf("%d %d",&zlto[i],&zlnm[i]);
    }
    int now=0;
    repi(i,1,m){
        int To=zlto[i],Nm=zlnm[i];
        if(toward[now]==0){
            if(To==0) now-=Nm;
            if(To==1) now+=Nm;
        }
        if(toward[now]==1){
            if(To==0) now+=Nm;
            if(To==1) now-=Nm;
        }
        while(now<0) now+=n;
        now%=n;
    }
    int len=strlen(name[now]);
    repi(i,0,len-1) printf("%c",name[now][i]);
    return 0;
}