#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int N=1e5+5,INF=1e9+5;
typedef long long ll;
inline int read(){char c=getchar();int x=0,f=1;while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}return x*f;
}
int n,m,a,s;
struct toy{int d;char s[15];
}t[N];
int main(){n=read();m=read();    for(int i=0;i<n;i++){t[i].d=read();scanf("%s",t[i].s);}int now=0;while(m--){ //printf("now %d\n",now);a=read();s=read();if(t[now].d==0){if(a==0) now=(now-s+n)%n;else now=(now+s)%n;}else{if(a==0) now=(now+s)%n;else now=(now-s+n)%n;}}printf("%s",t[now].s);return 0;
}

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int N=3e5+5,M=3e5+5,INF=1e9+5,B=3e5+2;
typedef long long ll;
inline int read(){char c=getchar();int x=0,f=1;while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}return x*f;
}int n,m,u,v,w[N],s,t;
struct edge{int v,ne;
}e[M<<1];
int cnt,h[N];
inline void ins(int u,int v){cnt++;e[cnt].v=v;e[cnt].ne=h[u];h[u]=cnt;cnt++;e[cnt].v=u;e[cnt].ne=h[v];h[v]=cnt;
}
struct thing{int w,ne;
}e1[N],e2[N],e3[N],e4[N];
int cnt1,cnt2,cnt3,cnt4,h1[N],h2[N],h3[N],h4[N];
inline void ins1(int u,int v,int w){cnt1++;e1[cnt1].w=w;e1[cnt1].ne=h1[u];h1[u]=cnt1;cnt3++;e3[cnt3].w=w;e3[cnt3].ne=h3[v];h3[v]=cnt3;
}
inline void ins2(int u,int v,int w){cnt2++;e2[cnt2].w=w;e2[cnt2].ne=h2[u];h2[u]=cnt2;cnt4++;e4[cnt4].w=w;e4[cnt4].ne=h4[v];h4[v]=cnt4;
}
int vis[N],deep[N],fa[N][21];
void dfs(int u){vis[u]=1;for(int j=1;j<=20;j++)fa[u][j]=fa[fa[u][j-1]][j-1];for(int i=h[u];i;i=e[i].ne){int v=e[i].v;if(vis[v]) continue;fa[v][0]=u;deep[v]=deep[u]+1;dfs(v);    }
}
int lca(int x,int y){if(deep[x]<deep[y]) swap(x,y);int bin=deep[x]-deep[y];for(int i=0;i<=20;i++) if((1<<i)&bin) x=fa[x][i];for(int i=20;i>=0;i--)if(fa[x][i]!=fa[y][i]){x=fa[x][i];y=fa[y][i];}if(x==y) return x;else return fa[x][0];
}
int c1[N<<1],c2[N<<1];
int ans[N];
void dfsSol(int u,int fa){int p1=w[u]+deep[u],p2=deep[u]-w[u]+B;ans[u]-=c1[p1]+c2[p2];for(int i=h[u];i;i=e[i].ne) if(e[i].v!=fa) dfsSol(e[i].v,u);for(int i=h1[u];i;i=e1[i].ne) c1[e1[i].w]++;for(int i=h3[u];i;i=e3[i].ne) c1[e3[i].w]--;for(int i=h2[u];i;i=e2[i].ne) c2[e2[i].w]++;for(int i=h4[u];i;i=e4[i].ne) c2[e4[i].w]--;ans[u]+=c1[p1]+c2[p2];
}
int main(){freopen("in.txt","r",stdin);n=read();m=read();for(int i=1;i<=n-1;i++) u=read(),v=read(),ins(u,v);for(int i=1;i<=n;i++) w[i]=read();dfs(1);for(int i=1;i<=m;i++){s=read();t=read();int a=lca(s,t),len=deep[s]+deep[t]-deep[a]-deep[a];ins1(s,fa[a][0],deep[s]);ins2(t,a,deep[t]-len+B);//printf("lca %d %d %d %d %d\n",i,s,t,a,len);
    }dfsSol(1,0);for(int i=1;i<n;i++) printf("%d ",ans[i]);printf("%d",ans[n]);
}

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int NN=2005,N=305;
const double INF=1e9+5;
typedef long long ll;
inline int read(){char c=getchar();int x=0,f=1;while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}return x*f;
}
int tn,tm,n,m,c[NN],d[NN],g[N][N],u,v,w;
double k[NN];
void floyd(){for(int k=1;k<=n;k++)for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)g[i][j]=min(g[i][j],g[i][k]+g[k][j]);
}double f[NN][NN][2];
void dp(){for(int i=1;i<=tn;i++)for(int j=0;j<=tm;j++) f[i][j][0]=f[i][j][1]=INF;f[0][0][0]=0;for(int i=1;i<=tn;i++)for(int j=0;j<=tm;j++){//printf("hi %d %d %.2f %.2f\n",i,j,f[i][j][0],f[i][j][1]);f[i][j][0]=min(f[i-1][j][0]+g[c[i-1]][c[i]],f[i-1][j][1]+g[d[i-1]][c[i]]*k[i-1]+g[c[i-1]][c[i]]*(1-k[i-1]));if(j>0) f[i][j][1]=f[i-1][j-1][0]+g[c[i-1]][d[i]]*k[i]+g[c[i-1]][c[i]]*(1-k[i]);if(j>1) f[i][j][1]=min(f[i][j][1],f[i-1][j-1][1]+k[i-1]*(g[d[i-1]][d[i]]*k[i]+g[d[i-1]][c[i]]*(1-k[i]))+(1-k[i-1])*(g[c[i-1]][d[i]]*k[i]+g[c[i-1]][c[i]]*(1-k[i])));}double ans=INF;for(int j=0;j<=tm;j++) ans=min(ans,min(f[tn][j][0],f[tn][j][1])); printf("%.2f",ans);
}
int main(){//freopen("in.txt","r",stdin);tn=read();tm=read();n=read();m=read();for(int i=1;i<=tn;i++) c[i]=read();for(int i=1;i<=tn;i++) d[i]=read();for(int i=1;i<=tn;i++) scanf("%lf",&k[i]);for(int i=1;i<=n;i++) for(int j=i+1;j<=n;j++) g[i][j]=g[j][i]=INF;for(int i=1;i<=m;i++){u=read();v=read();w=read();if(u!=v) g[u][v]=g[v][u]=min(g[u][v],w);}floyd();dp();
}