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

const int N=1e5+1e3+7;

int n,m,Q;

int len[N];

int ty[N];

int fa[N],in[N][2];

int deg[N];

vector<int> g[N];

map<int,int>idx;

int id(int x)
{
    if(!idx.count(x))
        idx[x]=idx.size()+1;
    return idx[x];
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>m>>n>>Q;
    int cnt=n*3;
    for(int i=1;i<=n;i++)
    {
        string s;
        cin>>s;
        int x=++cnt;
        int a,b,c;
        cin>>a>>b>>c;
        a=id(a);
        b=id(b);
        c=id(c);
        if(s[0]=='S')
        {
            g[a].push_back(x);
            deg[x]++;
            g[x].push_back(b),g[x].push_back(c);
            deg[b]++,deg[c]++;
            fa[b]=x,fa[c]=x;
            in[x][0]=a;
        }
        else
        {
            ty[x]=1;
            g[a].push_back(x),g[b].push_back(x);
            deg[x]+=2;
            in[x][0]=a,in[x][1]=b;
            g[x].push_back(c);
            deg[c]++;
            fa[c]=x;
        }
    }
    vector<int> sp;
    queue<int> q;
    q.push(1);
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        sp.push_back(x);
        for(auto v:g[x])
        {
            if(!--deg[v])
                q.push(v);
        }
    }
    len[1]=m;
    for(auto x:sp)
    {
        for(auto v:g[x])
        {
            if(v>n*3)
                len[v]+=len[x];
            else
            {
                assert(x>n*3);
                if(ty[x]==0)
                {
                    if(v==g[x][1])
                        len[v]+=len[x]/2;
                    else
                        len[v]+=(len[x]+1)/2;
                }
                else
                    len[v]+=len[x];
            }
        }
    }
    while(Q--)
    {
        int x,k;
        cin>>x>>k;
        x=id(x);
        if(k>len[x])
            cout<<"none\n";
        else
        {
            while(x!=1)
            {
                int z=fa[x];
                assert(z>n*3);
                if(ty[z]==0)
                {
                    k=k*2-(x==g[z][0]);
                    x=in[z][0];
                }
                else
                {
                    int mn=min(len[in[z][0]],len[in[z][1]]);
                    if(k<=mn*2)
                    {
                        if(k%2==1)
                            x=in[z][0];
                        else
                            x=in[z][1];
                        k=(k+1)/2;
                    }
                    else
                    {
                        int f=len[in[z][0]]<len[in[z][1]];
                        x=in[z][f];
                        k=k-mn;
                    }
                }
            }
            cout<<k<<"\n";
        }
    }
}