只通过13组

#include <bits/stdc++.h>
using namespace std;
struct xr
{
    int x;
    string y;
};
struct pss
{
    int x,y;
};
int main()
{ 
    xr a[100009];
    pss b[100009];
    int n,m;
    cin>>n>>m;
    for (int i=0;i<n;i++)
    {
        cin>>a[i].x>>a[i].y;
    }
    int is=0;
    for (int i=0;i<m;i++)
    {
        cin>>b[i].x>>b[i].y;
    }
    for (int i=0;i<m;i++)
    {
        if (a[is].x==1)
        {
            if (b[i].x==1) is = (10000*n+(is-b[i].y))%n;
            else is = (10000*n+(is+b[i].y))%n;
        }
        else 
        {
            if (b[i].x==1) is = (10000*n+(is-b[i].y))%n;
            else is = (10000*n+(is-b[i].y))%n;
        }
    }
    cout<<a[is].y;
    
    return 0;
}