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

using ll = long long;

void solve() {
    int m, n, Q;
    cin >> m >> n >> Q;
    vector<string> op(n + 1);
    vector<int> x(n + 1), y(n + 1), z(n + 1);
    vector<int> sz(4 * n, -1), fr(4 * n);
    sz[1] = m;
    for(int i = 1; i <= n; i++) {
        cin >> op[i] >> x[i] >> y[i] >> z[i];
        if(op[i][0] == 'S') {
            fr[y[i]] = fr[z[i]] = i;
            // sz[z[i]] = sz[x[i]] / 2, sz[y[i]] = sz[x[i]] - sz[z[i]];
        } else {
            // sz[z[i]] = sz[x[i]] + sz[y[i]];
            fr[z[i]] = i;
        }
    }
    function<int(int)> getSz = [&](int cur) {
        if(sz[cur] != -1) return sz[cur];
        int t = fr[cur];
        if(op[t][0] == 'S') {
            sz[z[t]] = getSz(x[t]) / 2, sz[y[t]] = getSz(x[t]) - getSz(z[t]);
        } else {
            sz[z[t]] = getSz(x[t]) + getSz(y[t]);
        }
        return sz[cur];
    };
    while(Q--) {
        int pos, val;
        cin >> pos >> val;
        auto slv = [&]() {
            while(pos > 1) {
                if(val > getSz(pos)) {
                    cout << "none\n";
                    return;
                }
                int t = fr[pos], npos, nval;
                if(op[t][0] == 'S') {
                    if(y[t] == pos) {
                        npos = x[t], nval = 2 * val - 1;
                    } else {
                        npos = x[t], nval = 2 * val;
                    }
                } else {
                    int szmn = min(getSz(x[t]), getSz(y[t]));
                    if(val <= 2 * szmn) {
                        if(val % 2) nval = (val + 1) / 2, npos = x[t];
                        else nval = (val + 1) / 2, npos = y[t];
                    } else {
                        if(getSz(x[t]) > getSz(y[t])) npos = x[t];
                        else npos = y[t];
                        nval = val - szmn;
                    }
                }
                pos = npos, val = nval;
            }
            cout << val << '\n';
        };
        slv();
    }
}
signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--) solve();
    return 0;
}
/*
5 8 1
M 8 9 13
S 2 4 5
S 1 2 3
M 6 5 8
S 4 9 10
S 10 14 15
S 3 6 7
S 7 11 12
8 2

*/