#include <bits/stdc++.h>
// #pragma comment(linker, "/STACK:268435456");,
using namespace std;

#define int             long long
#define double          long double
#define pb              push_back
#define all(t)          (t).begin(), (t).end()
#define rep(i,j)        for(int i = 0; i < (j); ++i)
#define rrep(i,j)       for(int i = (j)-1; i >= 0; --i)
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
const char nl = '\n';
const double eps = 1e-6;
const int N = 1e5, mod = 1e9 + 7, inf = 1e18;

int n;
vector<bool> visited;
vector<int> ans;
vector<vector<int>> adj;
vector<vector<int>> par;

void dfs(int v) {
    visited[v] = true;
    for (int u : adj[v]) {
        if (!visited[u])
            dfs(u);
    }
    ans.push_back(v);
}

void topological_sort() {
    visited.assign(2*n+1, false);
    ans.clear();
    for (int i = 1; i <= 2*n; ++i) {
        if (!visited[i])
            dfs(i);
    }
    reverse(ans.begin(), ans.end());
}

void solve()
{
    int m, q; cin >> m >> n >> q;
    vector<int> sz(2 * n + 1, 0);
    adj.resize(2 * n + 1);
    par.resize(2 * n + 1);
    par[1].pb(-1);
    rep(i, n) {
        char c; cin >> c;
        int x, y, z; cin >> x >> y >> z;
        if(c == 'S') {
            adj[x].pb(y);
            adj[x].pb(z);
            par[y].pb(x);
            par[z].pb(x);
        } else {
            adj[x].pb(z);
            adj[y].pb(z);
            par[z].pb(x);
            par[z].pb(y);
        }
    }
    topological_sort();
    sz[1] = m;
    for(auto i: ans) {
        if(adj[i].size() == 2) {
            sz[adj[i][0]] = (sz[i] + 1)/2;
            sz[adj[i][1]] = sz[i]/2;
        } else if(adj[i].size() == 1) {
            sz[adj[i][0]] += sz[i];
        }
    }
    rep(i, q) {
        int x, y; cin >> x >> y;
        int node = x, ind = y;
        if(ind > sz[node]) {
            cout << "none\n";
            continue;
        }
        while(par[node][0] != -1) {
            // assert(ind <= sz[node]);
            if(par[node].size() == 2) {
                // assert(sz[node] == sz[par[node][0]] + sz[par[node][1]]);
                int overlap = min(sz[par[node][0]], sz[par[node][1]]) * 2;
                if(ind <= overlap) {
                    node = par[node][(ind + 1) % 2];
                    ind = (ind + 1)/2;
                } else {
                    if(sz[par[node][0]] < sz[par[node][1]]) {
                        node = par[node][1];
                    } else {
                        node = par[node][0];
                    }
                    ind = ind - overlap/2;
                }
            } else if(par[node].size() == 1) {
                int prev = node;
                node = par[node][0];
                // assert(adj[node].size() == 2);
                int wh = 0;
                if(adj[node][1] == prev) wh = 1;
                ind = ind * 2 - (wh ^ 1);
            } else {
                // assert(0);
            }
        }

        cout << ind << nl;
    }
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(numeric_limits<double>::max_digits10);
    cout << setprecision(15) << fixed;
    #ifdef aak_local
       freopen("/Users/aak/Desktop/Comding/Competitive/input.txt","r",stdin);
       freopen("/Users/aak/Desktop/Comding/Competitive/output.txt","w",stdout);
    #endif
    int tt = 1;
    // cin >> tt;
    for(int i = 1; i <= tt; ++i)
    {
        // cout << "Case #" << i << ": ";
        solve();
    }
    return 0;
}