#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vll vector<ll>
#define FOR(i,n) for(int i=0;i<n;i++)
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define pb push_back
#define f first
#define s second

const int MOD = (int)1e9+7;

const int N = 2e4;
struct Node{
    int num;  int idx; char type;
    int o1=-1, o2=-1;
    int i1=-1, i2=-1;
    Node(int num=0,int idx=0, char type='S') : num(num),idx(idx),type(type) {}
};

vector<Node> G;
int solve(int u, int k){
    if(u==0) return k+1;
    if(G[u].i1==-1) return -1;
    if(G[u].num<=k) return -1;
    int ans = -1;
    //case 1 u is the output of merge 
    if(G[u].i1!=-1 && G[u].i2!=-1){
        int i1 = G[u].i1; int i2 = G[u].i2;
        int el = min(G[i1].num,G[i2].num);
        if(k<el*2){
            if(k%2==0)
                ans = solve(i1,k/2);
            else
                ans = solve(i2,(k-1)/2);
        }
        else{
            if(G[i1].num>G[i2].num)
                ans = solve(i1,k-G[i2].num);
            else
                ans = solve(i2,k-G[i1].num);
        }
    }
    //case 2 u is the output of split 
    else{
        int input = G[u].i1;  
        if(G[input].o1==u)
            //left output
            ans = solve(input,k*2);
        else
            //right output
            ans = solve(input,k*2+1);
    }
    return ans;
}

int main()
{
    int n,m,q;
    cin>>m>>n>>q;
    G.resize(2*n);
    FOR(i,2*n) G[i].idx = i;
    vi indeg(2*n,0);
    set<int> all;
    FOR(i,n){
        char type; int a,b,c;
        cin>>type>>a>>b>>c;
        a--; b--; c--;
        all.insert(a); all.insert(b); all.insert(c);
        if(type=='S'){
            //a = input
            //b = out1   c = out2
            G[b].i1 = a; G[c].i1 = a;
            G[a].o1 = b; G[a].o2 = c; 
            indeg[b]++; indeg[c]++;
        }
        else{
            //a = input1  b = input2 
            G[c].i1 = a; G[c].i2 = b;
            //c = out
            G[a].o1 = c; G[b].o1 = c;
            indeg[c]+=2;
        }
    }
    queue<int> pq;
    for(int i: all) if(indeg[i]==0){
        pq.push(i);
    }
    G[0].num=m;
    assert(sz(pq)==1);
    while(!pq.empty()){
        int u = pq.front(); pq.pop();
        int v1 = G[u].o1; int v2 = G[u].o2;
        if(v1!=-1){
            indeg[v1]--;
            if(indeg[v1]==0) pq.push(v1);
        }
        if(v2!=-1){
            indeg[v2]--;
            if(indeg[v2]==0) pq.push(v2);
        }
        if(v1!=-1 && v2!=-1){
            G[v1].num = (G[u].num/2)+(G[u].num%2);
            G[v2].num = (G[u].num/2);
        }
        else if(v1!=-1){
            G[v1].num+=G[u].num;
        }
    }
    FOR(i,q){
        int u, k;
        cin>>u>>k; u--;
        int ans = solve(u,k-1);
        if(ans==-1) cout<<"none\n";
        else cout<<ans<<endl;
    }
    return 0;
}