#include<iostream>

 #include<cstdio>

 #include<algorithm>

 #include<map>

 #include<stack>

 #include<string.h>

 #include<math.h>

 #include<queue>

 #define INF 2147483647

 #define F(i,n) for(int i=0;i<n;i++)

 #define F1(i,n) for(int i=1;i<=n;i++)

 #define W while

 #define S scanf

 #define P printf

 #define DD "%d%d"

 #define DDD "%d%d%d"

 #define DDDD "%d%d%d%d"

 #define D "%d"

 #define I int

 #define V void

 #define C char

 #define R return

 #define MS(i,a) memset(i,a,sizeof(i))

 #define LL long long

 #define SS string

 #define DB double

 #define PR priority_queue

 #define ST struct

 #define FBO friend bool operator

 #define LDB long double

 #define PI 3.14159265358979323846264

 #define FI(x) freopen(x,"r",stdin);

 #define FO(x) freopen(x,"w",stdout);

 #define M 300000

 using namespace std;

 bool b[M]={};

 //string s[M]={0};

 char s[M][]={};

 int n,m;

 int main()

 {

     S(DD,&n,&m);

     F1(i,n)

     {

         int x;

         S(D,&x);b[i]=x;

         S("%s",&s[i]);

     }

     int now=;

     F1(i,m)

     {

         int x,y;

         S(DD,&x,&y);

         if(b[now]&&x) y=-y;

         if(b[now]==&&x==) y=-y;

         now=+(n+now+y-)%n;

     }

     P("%s",s[now]);

 }