#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;

const int N=30005;

map<int,int>mp;
int idx;

int sz[N];

struct node{
	char c;
	int x,y,z;
};

int fr[N],fr_[N],ty[N];

int ID(int x){
	if(mp.count(x)){
		return mp[x];
	}else{
		return mp[x]=++idx;
	}
}
int m,n,Q;

int ask(int u,int x){
	if(u==1){
		return x;
	}
	if(ty[u]==0){
		return ask(fr[u],x*2-1);
	}else if(ty[u]==1){
		return ask(fr[u],x*2); 
	}else{
		if(x>sz[fr[u]]*2-1){
			return ask(fr_[u],x-sz[fr[u]]);
		}else if(x>sz[fr_[u]]*2){
			return ask(fr[u],x-sz[fr_[u]]);
		}else if(x&1){
			return ask(fr[u],(x+1)/2);
		}else{
			return ask(fr_[u],x/2);
		}
	}
}

int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	cin>>m>>n>>Q;
	sz[ID(1)]=m;
	rep(i,1,n){
		char c;
		cin>>c;
		int x,y,z;
		cin>>x>>y>>z;
		x=ID(x),y=ID(y),z=ID(z);
		if(c=='S'){
			sz[y]=(sz[x]+1)/2;
			fr[y]=x;
			ty[y]=0;
			
			sz[z]=sz[x]/2;
			fr[z]=x;
			ty[z]=1;
		}else{
			
			sz[z]=sz[x]+sz[y];
			fr[z]=x,fr_[z]=y,ty[z]=2;
		}
	}
	rep(tc,1,Q){
		int x,k;
		cin>>x>>k;
		if(k>sz[x]){
			puts("none");
		}else{
			printf("%d\n",ask(x,k));
		}
	}
	return 0;
}