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

using ll=long long;
#define int ll
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define all(x) begin(x),end(x)
#define sz(x) (int)((x).size())
using pii=pair<int,int>;
using vi=vector<int>;
#define fi first
#define se second
#define pb push_back

signed main() {
	cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int m, n, q;
    cin >> m >> n >> q;
    vector<array<int, 3>> gates(2*n + 2);
    vector<vector<int>> before(n*2+2);
    vector<int> ord, vis(2*n+2, 1), len(2*n+2);
    vis[1] = 0;
    for(int i = 0; i < n; i++) {
        char c; int x, y, z;
        cin >> c >> x >> y >> z;
        vis[x] = vis[y] = vis[z] = 0;
        if(c == 'S') {
            gates[y] = {0, x, 0};
            gates[z] = {1, x, 0};
            before[y].push_back(x);
            before[z].push_back(x);
        } else {
            gates[z] = {2, x, y};
            before[z].push_back(x);
            before[z].push_back(y);
        }
    }

    auto dfs = [&](auto self, int v) -> void {
        if(vis[v]) return;
        for(auto i : before[v]) self(self, i);
        ord.push_back(v);
    };
    for(int i = 0; i < vis.size(); i++) if(!vis[i])
            dfs(dfs, i);

    len[1] = m;
    for(auto i : ord) if(i > 1) {
        if(gates[i][0] < 2) {
            len[i] = (len[gates[i][1]] + 1 - gates[i][0]) / 2;
        } else {
            len[i] = len[gates[i][1]] + len[gates[i][2]];
        }
    }

    for(int g, k, i = 0; i < q; i++) {
        cin >> g >> k; k--;
        if(k >= len[g]) cout << "none\n";
        else {
            while(g != 1) {
                if(gates[g][0] < 2) {
                    k = 2 * k + gates[g][0];
                    g = gates[g][1];
                } else {
                    int sh = min(len[gates[g][1]], len[gates[g][2]]);
                    if(k < 2*sh) {
                        g = gates[g][1 + (k & 1)];
                        k /= 2;
                    } else {
                        k -= sh;
                        if(len[gates[g][1]] != sh)
                            g = gates[g][1];
                        else
                            g = gates[g][2];

                    }
                }
            }cout << 1+k << '\n';
        }
    }
}