#if not LOCAL
#define NDEBUG 1
#endif
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(auto i = a; i < (b); ++i)
#define down(x, a) for (auto x = a; x--;)
#define all(x) begin(x), end(x)
#define sz(x) int(size(x))
#define let auto const

using ll = long long;
using lint = ll;
using pii = pair<int, int>;
using vi = vector<int>;

struct Node {
  Node *inp1 = nullptr, *inp2 = nullptr;
  int siz;
  bool isLe = false;
  Node(int siz, bool isLe = false) : siz(siz), isLe(isLe){}
};

const int N = 100005;

Node* arr[N];

char cc[N];
int xx[N], yy[N], zz[N];
int help[N];
int indeg[N];
int main() {
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);

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

  arr[0] = new Node(m);

  queue<int> que;
  rep(i, 0, N) help[i] = -1;
  rep(i, 0, n) {
    cin>>cc[i]>>xx[i]>>yy[i]>>zz[i];
    --xx[i]; --yy[i]; --zz[i];
    if(xx[i] == 0) que.push(i);
    if(cc[i] == 'M') {
      indeg[i] = 2;
      help[xx[i]] = i;
      help[yy[i]] = i;
    } else {
      indeg[i] = 1;
      help[xx[i]] = i;
    }
  }

  while(!que.empty()) {
    int x = xx[que.front()], y = yy[que.front()], z = zz[que.front()];
    char c = cc[que.front()];
    que.pop();
    if(c == 'S') {
      assert(arr[x] != nullptr);
      assert(arr[y] == nullptr && arr[z] == nullptr);
      arr[y] = new Node( (arr[x] -> siz + 1 ) / 2, true);
      arr[z] = new Node( (arr[x] -> siz) / 2);
      arr[y] -> inp1 = arr[x];
      arr[z] -> inp1 = arr[x];
      if(help[z] != -1 && --indeg[help[y]] == 0) que.push(help[y]);
      if(help[z] != -1 && --indeg[help[z]] == 0) que.push(help[z]);
    } else {
      assert(arr[x] != nullptr && arr[y] != nullptr);
      assert(arr[z] == nullptr);
      arr[z] = new Node( arr[x] -> siz + arr[y] -> siz);
      arr[z] -> inp1 = arr[x];
      arr[z] -> inp2 = arr[y];
      if(help[z] != -1 && --indeg[help[z]] == 0) que.push(help[z]);
    }
  }

  while(q--) {
    int x, k;
    cin>>x>>k;
    --x;
    if(arr[x] == nullptr) {
      cout<<x<<' ';
      cout<<"none\n";
      continue;
    }
    Node *cur = arr[x];
    while(cur != arr[0]) {
      // cout<<(cur -> siz)<<' '<<cur -> inp1 -> siz<<' '<<cur -> inp2 -> siz<<'\n';
      if(cur -> inp2 == nullptr) {
        k = k * 2 - (cur -> isLe == true);
        cur = cur -> inp1;
      } else {
        if(k <= 2 * min(cur -> inp1 -> siz, cur -> inp2 -> siz)) {
          if(k % 2 == 1) {
            cur = cur -> inp1;
            k = (k + 1) / 2;
          } else {
            cur = cur -> inp2;
            k = k / 2;
          }
        } else {
          k -= min(cur -> inp1 -> siz, cur -> inp2 -> siz);
          if(cur -> inp1 -> siz > cur -> inp2 -> siz) {
            cur = cur -> inp1;
          } else {
            cur = cur -> inp2;
          }
        }
      }
    }
    if(k > m) cout<<"none\n";
    else cout<<k<<'\n';
  }
}