#include<bits/stdc++.h>
using namespace std;
const int N=2e4+10;
const long long inf=1e18;
int pre[N],nxt[N];
struct node
{
    int o,x,y,z;
}e[N];
int m,n,q;
long long len[N];
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin>>m>>n>>q;
    len[1]=m;
    for(int i=1;i<=n;++i)
    {
        char s[10];
        int x,y,z;
        cin>>s>>x>>y>>z;
        e[i]=node{*s=='S',x,y,z};
        if(*s=='S')
        {
            pre[y]=pre[z]=nxt[x]=i;
            len[y]=len[x]+1>>1,
            len[z]=len[x]>>1;
        }
        else
        {
            pre[z]=nxt[x]=nxt[y]=i;
            len[z]=min(inf,len[x]+len[y]);
        }
    }
    while(q--)
    {
        int x,k;
        cin>>x>>k;
        // cerr<<endl;
        if(len[x]<k){cout<<"none\n";continue;}
        while(x!=1)
        {
            int i=pre[x];
            // cerr<<x<<": "<<k<<" "<<pre[x]<<" : "<<e[i].o<<","<<e[i].x<<","<<e[i].y<<","<<e[i].z<<endl;;
            if(e[i].o==1)//Split
            {
                k=k*2-(e[i].y==x);
                x=e[i].x;
            }
            else//Merge
            {
                long long mn=min(len[e[i].x],len[e[i].y]);
                if(k>mn*2)
                {
                    k-=mn;
                    int mx=len[e[i].x]>len[e[i].y]?e[i].x:e[i].y;
                    x=mx;
                }
                else
                {
                    if(k&1)//from x
                    {
                        k=k+1>>1;
                        x=e[i].x;
                    }
                    else//ffrom y
                    {
                        k>>=1;
                        x=e[i].y;
                    }
                }
            }
        }
        cout<<k<<"\n";
    }
    return 0;
}