#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N=50050;
int par[N],pos[N],fir[N],sec[N],spl[N],sz[N];
int main(){
    int m,n,q;
    scanf("%i %i %i",&m,&n,&q);
    sz[1]=m;
    for(int i=1;i<=n;i++){
        char t[5];
        int x,y,z;
        scanf("%s %i %i %i",t,&x,&y,&z);
        if(t[0]=='S'){
            spl[y]=1;
            par[y]=x;
            pos[y]=0;
            sz[y]=(sz[x]+1)/2;

            spl[z]=1;
            par[z]=x;
            pos[z]=1;
            sz[z]=sz[x]/2;
        }else{
            spl[z]=0;
            fir[z]=x;
            sec[z]=y;
            sz[z]=sz[x]+sz[y];
        }
    }
    for(int i=1;i<=q;i++){
        int x;
        ll k;
        scanf("%i %lld",&x,&k);
        bool ok=true;
        if(k>sz[x])ok=false;
        else{
            while(x!=1){
                if(spl[x]==0){
                    if(k<=2*min(sz[fir[x]],sz[sec[x]])){
                        if(k%2==1)x=fir[x];
                        else x=sec[x];
                        k=(k+1)/2;
                    }else{
                        if(sz[fir[x]]>sz[sec[x]]){
                            k-=sz[sec[x]];
                            x=fir[x];
                        }else{
                            k-=sz[fir[x]];
                            x=sec[x];
                        }
                    }
                }else{
                    if(pos[x]==0)k=2*k-1;
                    else k=2*k;
                    x=par[x];
                }
                /*if(k>m){
                    ok=false;
                    break;
                }*/
                //printf("->%i %lld\n",x,k);
            }
        }
        //if(k>m)ok=false;
        if(ok)printf("%lld\n",k);
        else printf("none\n");
    }
    return 0;
}