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

int m, n, q, s[100100], p[100100], r[100100];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> m >> n >> q;

    s[1] = m;

    for(int i=1;i<=n;i++) {
        char c; cin >> c;
        int x, y, z; cin >> x >> y >> z;

        if(c == 'S') {
            p[y] = p[z] = x;
            r[y] = -1, r[z] = -2;
            s[y] = (s[x]+1)/2;
            s[z] = s[x]/2;
        } else {
            p[z] = x, r[z] = y;
            s[z] = s[x]+s[y];
        }
    }

    while(q--) {
        int u, c; cin >> u >> c;

        if(s[u] < c) {
            cout << "none\n";
            continue;
        }

        while(u != 1) {
            int A = p[u], B = r[u];
            if(B < 0) {
                u = A;
                c = c*2 - (B == -1);
            } else {
                if(c <= min(s[A], s[B])*2) {
                    u = c % 2 ? A : B;
                    c = (c+1)/2;
                } else {
                    u = s[A] > s[B] ? A : B;
                    c = c - min(s[A], s[B]);
                }
            }
        }

        cout << c << "\n";
    }
}