#include<iostream>
#include <bits/stdc++.h>

#define ld long double
#define ll long long
#define IO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;
const int N = 1e5 + 9, MOD = 998244353;

pair<int, int> mergeNodes[N];
int firstChild[N], secondChild[N];
int len[N];

void doWork() {
    int m, n, q;
    cin >> m >> n >> q;
    len[1] = m;
    while (n--) {
        char c;
        int x, y, z;
        cin >> c >> x >> y >> z;
        if (c == 'M') {
            mergeNodes[z] = {x, y};
            len[z] = len[x] + len[y];
        } else {
            firstChild[y] = x;
            len[y] = (len[x] + 1) / 2;
            secondChild[z] = x;
            len[z] = len[x] / 2;
        }
    }
    while (q--) {
        int x, k;
        cin >> x >> k;
        bool ans = true;
        while (x > 1 && ans) {
            if (len[x] < k) {
                ans = false;
                break;
            }
            if (firstChild[x]) {
                k = 2 * k - 1;
                x = firstChild[x];
            } else if (secondChild[x]) {
                k = 2 * k;
                x = secondChild[x];
            } else {
                int a = mergeNodes[x].first, b = mergeNodes[x].second;
                int p = min(len[a], len[b]);
                if (k <= 2 * p) {
                    x = k % 2 ? a : b;
                    k = (k + 1) / 2;
//                    cout << "f " << a << " " << b << " " << k << "\n";
                } else if (len[a] > len[b]) {
                    k -= p;
                    x = a;
                } else {
                    k -= p;
                    x = b;
                }
            }
        }
        if (ans)
            cout << k << "\n";
        else
            cout << "none\n";
    }
}

int main() {

    IO
    int t = 1;
//    cin >> t;
    for (int i = 1; i <= t; i++) {
        //  cout << "Case #" << i << ": ";
        doWork();
    }
}