#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
 
mt19937 rng((int) chrono::steady_clock::now().time_since_epoch().count());
    
const int MOD = 1e9 + 7;
const int MAXN = 2e4 + 5;
const int INF = 1e9;

bool first[MAXN], split[MAXN];
int tam[MAXN], v[MAXN][2], m;

int calcTam(int node) {
    if (tam[node] >= 0) return tam[node];
    if (split[node]) {
        if (first[node]) tam[node] = calcTam(v[node][0]) / 2 + calcTam(v[node][0]) % 2;
        else tam[node] = calcTam(v[node][0]) / 2;
    }
    else {
        tam[node] = calcTam(v[node][0]) + calcTam(v[node][1]);
    }
    return tam[node];
}

ll dfs(int node, ll k) {
    if (node == 1) return k;
    if (split[node]) {
        if (2 * k - 1 > m) return m + 1;
        if (first[node]) {
            return dfs(v[node][0], 2 * k - 1);
        }
        return dfs(v[node][0], 2 * k);
    }
    int mn = min(tam[v[node][0]], tam[v[node][1]]);
    if (k <= 2 * mn) {
        if (k % 2 == 0) {
            return dfs(v[node][1], k / 2);
        }
        return dfs(v[node][0], k / 2 + 1);
    }
    if (tam[v[node][0]] == mn) {
        return dfs(v[node][1], k - mn);
    }
    return dfs(v[node][0], k - mn);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, q;
    cin >> m >> n >> q;
    char c;
    int x, y, z;
    int tot = 0;
    for (int i = 0; i < n; i++) {
        cin >> c >> x >> y >> z;
        if (c == 'S') {
            first[y] = true;
            first[z] = false;
            split[y] = split[z] = true;
            v[y][0] = v[z][0] = x;
            v[y][1] = z;
            v[z][1] = y;
        }
        else {
            split[z] = false;
            v[z][0] = x, v[z][1] = y;
        }
        tot = max({tot, x, y, z});
    }
    for (int i = 1; i <= tot; i++) tam[i] = -1;
    tam[1] = m;
    for (int i = 1; i <= tot; i++) {
        calcTam(i);
    }
    for (int i = 0; i < q; i++) {
        cin >> x >> y;
        int k = dfs(x, y);
        if (k > m) cout << "none\n";
        else cout << k << '\n';
    }
    return 0;
}