#include <bits/stdc++.h>

using namespace std;

#define ll long long

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    ll n,q,m;
    cin>>m>>n>>q;
    vector<ll> sz(4*n+1,0);
    vector<pair<int,int>> par(4*n+1,{-1,-1});
    sz[1]=m;
    for(int i=0;i<n;i++){
        char p;
        int x,y,z;
        cin>>p>>x>>y>>z;
        if(p=='S'){
            par[y]={x,-1};
            par[z]={-1,x};
            assert(x<y);
            assert(x<z);
        }
        else {
            par[z]={x,y};
            assert(z>x);
            assert(z>y);
        }
    }

    for(int i=2;i<4*n;i++){
        if(par[i]==make_pair(-1,-1)) break;
        int x=par[i].first;
        int y=par[i].second;
        if(x==-1) sz[i]=sz[y]/2;
        else if(y==-1) sz[i]=(sz[x]+1)/2;
        else sz[i]=sz[x]+sz[y];
    }
    
    while(q--){
        ll u,k;
        cin>>u>>k;
        int f=1;
        while(u!=1){
            int x=par[u].first;
            int y=par[u].second;
            if(k>sz[u]){
                f=0;
                break;
            }
            if(x==-1){
                u=y;
                k=2LL*k;
            }   
            else if(y==-1){
                u=x;
                k=2LL*k-1LL;
            }
            else{
                ll a=sz[x];
                ll b=sz[y];
                if(k>a+b){
                    f=0;
                    break;
                }
                if(a>=b){
                    if(k<=2LL*b){
                        if(k%2) u=x;
                        else u=y;
                        k=(k+1LL)/2;
                    }
                    else{
                        u=x;
                        k=k-b;
                    }
                }
                else{
                    if(k<=2LL*a){
                        if(k%2) u=x;
                        else u=y;
                        k=(k+1LL)/2;
                    }
                    else{
                        u=y;
                        k=k-a;
                    }
                }
            }
        }
        if(k>m) f=0;
        if(!f) cout<<"none\n";
        else cout<<k<<"\n";
    }



}