#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<double, double>
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define N 200015
using namespace std;
int n, m, q, fa1[N], fa2[N], son1[N], son2[N], type_down[N], type_up[N], sz[N];
void dfs(int p){
    if (!type_down[p])
        return;
    if (type_down[p] == 1){
        sz[son1[p]] = (sz[p] + 1) / 2;
        sz[son2[p]] = sz[p] / 2;
        dfs(son1[p]), dfs(son2[p]);
    }
    else {
        int nxt = son1[p];
        if (sz[fa1[nxt]] == 0 || sz[fa2[nxt]] == 0)
            return;
        sz[nxt] = sz[fa1[nxt]] + sz[fa2[nxt]];
        dfs(nxt);
    }
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> m >> n >> q;
    for (int i = 1; i <= n; i++){
        char c;
        int x, y, z;
        cin >> c >> x >> y >> z;
        if (c == 'S'){
            son1[x] = y, son2[x] = z;
            fa1[y] = x, fa1[z] = x;
            type_down[x] = 1, type_up[y] = 2, type_up[z] = 3; 
        }
        else {
            son1[x] = z, son1[y] = z;
            fa1[z] = x, fa2[z] = y;
            type_down[x] = 2, type_down[y] = 2, type_up[z] = 1; 
        }
    }
    sz[1] = m, dfs(1);
    while (q--){
        ll x, k; cin >> x >> k;
        if (k > sz[x]){
            cout << "none\n";
            continue;
        }
        while (x != 1){
            if (type_up[x] == 1){
                int sz1 = sz[fa1[x]], sz2 = sz[fa2[x]];
                if (min(sz1, sz2) * 2 >= k){
                    if (k % 2)
                        x = fa1[x], k = (k + 1) / 2;
                    else x = fa2[x], k = k / 2;
                }
                else if (sz1 > sz2){
                    x = fa1[x];
                    k = (k - sz2);
                }
                else {
                    x = fa2[x];
                    k = (k - sz1);
                }
            }
            else if (type_up[x] == 2){
                k = 2 * k - 1;
                x = fa1[x];
            }
            else {
                x = fa1[x];
                k = k * 2;
            }
        }
        cout << k << "\n";
    }
}
/*
100 3 1
S 1 4 2
S 2 3 5
M 3 4 6
6 51
*/