本题不知道为什么突然过不了了,本来能过。
#include<bits/stdc++.h>
#define int long long
#define il inline
#define pii pair<int,int>
#define mk make_pair
#define mod 100000000
using namespace std;
il int rd(){
int jya=0,tl=1;char jyt=getchar();
while(!isdigit(jyt)){if(jyt=='-')tl=-1;jyt=getchar();}
while(isdigit(jyt)){jya=(jya<<1)+(jya<<3)+(jyt-'0');jyt=getchar();}
return jya*tl;
}
il void wr(int jjy){
if(jjy<0)putchar('-'),jjy=-jjy;
if(jjy>9)wr(jjy/10);
putchar(jjy%10+48);
}
il int max(int x,int y){return x>=y?x:y;}
il int min(int x,int y){return x<=y?x:y;}
const int JYAAKIOI=1145141919810;
int n,m,k,now=1,l[10086],r[10086],lst=1,jyt[10086],ljyt,t[100086],st,lenhuan;
char a[10086];
signed main(){
freopen("cruise.in","r",stdin);
freopen("cruise.out","w",stdout);
n=rd();m=rd();k=rd()+1;
for(int i=1;i<=n;++i){
l[i]=rd();
r[i]=rd();
}
for(int i=1;i<=m;++i)cin>>a[i];
t[1]=1;
jyt[1]=1;
ljyt=1;
while(1){
for(int i=1;i<=m;++i){
if(a[i]=='L')now=l[now];
else now=r[now];
}
jyt[++ljyt]=now;
if(t[jyt[ljyt]]){
st=now;
break;
}
t[jyt[ljyt]]=1;
}
for(int i=1;i<=ljyt;++i){
if(jyt[i]==st){
st=i;
break;
}
}
if(k<st){
wr(jyt[k]);
return 0;
}
k-=(st-1);
lenhuan=ljyt-st;
k%=lenhuan;
if(k==0)k=lenhuan;
wr(jyt[st+k-1]);
return 0;
}