#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define debug(x) cerr << "[" << __LINE__ << ' ' << #x << "]: " << (x) << endl

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int m, n, q;
    cin >> m >> n >> q;

    vector<vector<int>> g(n + 3*n+1);
    vector<vector<int>> g2(n + 3*n+1);
    vector<int> deg(4*n+1);
    for (int i=0; i<n; i++) {
        char c;
        int x, y, z;
        cin >> c >> x >> y >> z;
        if (c == 'S') {
            g[n+x].push_back(i);
            g[i].push_back(n+y);
            g[i].push_back(n+z);
            g2[i].push_back(n+x);
            g2[n+y].push_back(i);
            g2[n+z].push_back(i);
            deg[i]++;
            deg[n+y]++;
            deg[n+z]++;
        } else {
            g[n+x].push_back(i);
            g[n+y].push_back(i);
            g[i].push_back(n+z);
            g2[i].push_back(n+x);
            g2[i].push_back(n+y);
            g2[n+z].push_back(i);
            deg[i] += 2;
            deg[n+z]++;
        }
    }

    vector<int> topo;
    for (int i=0; i<4*n+1; i++) if (deg[i] == 0) topo.push_back(i);

    vector<int> sz(g.size());
    sz[n+1] = m;
    for (int i=0; i<(int)topo.size(); i++) {
        int e = topo[i];
        if (g[e].size() == 0) continue;
        if (g[e].size() == 1) sz[g[e][0]] += sz[e];
        else {
            sz[g[e][0]] += (sz[e]+1) / 2;
            sz[g[e][1]] += (sz[e]) / 2;
        }

        for (int f : g[e]) {
            deg[f]--;
            if (deg[f] == 0) topo.push_back(f);
        }
    }

    while (q--) {
        int x, k;
        cin >> x >> k;
        if (sz[n+x] < k) {
            cout << "none\n";
            continue;
        }

        int cur = n+x;
        while (cur != n+1) {
            if (g2[cur].size() == 2) {
                int a = g2[cur][0], b = g2[cur][1];
                int mn = min(sz[a], sz[b]);
                if (2 * mn >= k) {
                    if (k % 2 == 1) k = (k+1)/2, cur = a;
                    else k /= 2, cur = b;
                } else {
                    k -= mn;
                    if (sz[a] > mn) cur = a;
                    else cur = b;
                }
            } else {
                int par = g2[cur][0];
                if (g[par].size() == 2) {
                    k *= 2;
                    if (cur == g[par][0]) k--;
                }
                cur = par;
            }
        }
        cout << k << '\n';
    }
}