#include <bits/stdc++.h>
#define ll long long int
#define pll pair<ll, ll>
#define X first
#define Y second
#define all(v) v.begin(),v.end()
using namespace std;
const ll INF = 9876543210;
const ll MOD = 1e9 + 7;
int dx[] = { -1, -1, -1, 0, 0, 1, 1, 1 };
int dy[] = { -1, 0, 1, -1, 1, -1, 0, 1 };
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

ll m, n, q;
ll mxnode;
ll sz[20005];
pll from[20005]; // {S로부터 오면 1/M으로부터 오면 2, S왼쪽에서 오면 1/S오른쪽에서 오면 2} 
pll fromx[20005]; // 왼, 오

ll getSz(ll x)
{
    ll& ret = sz[x];
    if (ret != -1) return ret;
    if (x == 1) return ret = m;
    if (from[x].X == 1)
    {
        if (from[x].Y == 1) ret = sz[fromx[x].X] / 2 + sz[fromx[x].X] % 2;
        else ret = sz[fromx[x].X] / 2;
    }
    else ret = sz[fromx[x].X] + sz[fromx[x].Y];
    return ret;
}

ll go(ll x, ll k)
{
    //cout << x << ' ' << k << '\n';
    if (k > sz[x]) return -1;
    if (x == 1) return k;
    if (from[x].X == 1)
    {
        if (from[x].Y == 1) return go(fromx[x].X, 2 * k - 1);
        else return go(fromx[x].X, 2 * k);
    }
    else
    {
        ll mn = min(sz[fromx[x].X], sz[fromx[x].Y]);
        if (k <= 2 * mn)
        {
            if (k % 2) return go(fromx[x].X, (k + 1) / 2);
            else return go(fromx[x].Y, k / 2);
        }
        else
        {
            if (sz[fromx[x].X] == mn) return go(fromx[x].Y, k - mn);
            else return go(fromx[x].X, k - mn);
        }
    }
}

void solve()
{
    cin >> m >> n >> q;
    for (int i = 0; i < n; i++)
    {
        char t; ll x, y, z; cin >> t >> x >> y >> z;
        mxnode = max(mxnode, max(x, max(y, z)));
        if (t == 'S')
        {
            from[y] = { 1, 1 };
            from[z] = { 1, 2 };
            fromx[y] = fromx[z] = {x, 0};
        }
        else
        {
            from[z].X = 2;
            fromx[z] = { x, y };
        }
    }
    memset(sz, -1, sizeof(sz));
    for (int i = 1; i <= mxnode; i++)
    {
        sz[i] = getSz(i);
        //cout << sz[i] << ' ';
    }
    while (q--)
    {
        ll x, k; cin >> x >> k;
        ll res = go(x, k);
        if (res == -1) cout << "none\n";
        else cout << res << '\n';
    }
}

int main()
{
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    int tc = 1; //cin >> tc;
    while (tc--) solve();
    return 0;
}