#include <bits/stdc++.h>
#define fst first
#define snd second
#define fore(i,a,b) for(int i=a,ThxDem=b;i<ThxDem;++i)
#define pb push_back
#define ALL(s) s.begin(),s.end()
#define FIN ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define SZ(s) int(s.size())
using namespace std;
typedef long long ll;
typedef pair<int,int> ii;

const int MAXN=1e5+10;
int wh[MAXN],in[MAXN],am[MAXN];
ii par[MAXN],to[MAXN];

int main(){FIN;
	ll m,n,q; cin>>m>>n>>q;
	
	string s(n,'.');
	
	int k=1;
	fore(i,0,n){
		char c; int x,y,z; cin>>c>>x>>y>>z;
		k=max({k,x,y,z});
		x--; y--; z--;
		s[i]=c;
		
		if(c=='S'){
			to[x]={y,z};
			wh[y]=0; wh[z]=0;
			in[y]++; in[z]++;
			par[y]={x,0};
			par[z]={x,1};
		}
		else{
			to[x]={z,0};
			to[y]={z,0};
			wh[z]=1;
			in[z]++;
			par[z]={x,y};
		}
	}
	
	queue<int> qq;
	qq.push(0); am[0]=m;
	while(SZ(qq)){
		int pos=qq.front(); qq.pop();

		if(to[pos].snd){
			am[to[pos].fst]+=(am[pos]+1)/2;
			am[to[pos].snd]+=am[pos]/2;
		}
		else if(to[pos].fst){
			am[to[pos].fst]+=am[pos];
		}
		
		if(to[pos].fst){
			in[to[pos].fst]--;
			if(!in[to[pos].fst]) qq.push(to[pos].fst);
		}
		if(to[pos].snd){
			in[to[pos].snd]--;
			if(!in[to[pos].snd]) qq.push(to[pos].snd);
		}
	}
	
	while(q--){
		int x,k; cin>>x>>k; x--;
		
		int bad=0;
		while(!bad){
			if(am[x]<k){
				bad=1;
			}
			
			else if(x==0){
				break;
			}
			
			else if(wh[x]==0){
				if(par[x].snd==0) k=2*k-1;
				else k=2*k;
				x=par[x].fst;
			}
			else{
				int l=par[x].fst, r=par[x].snd;
				int asd=2*min(am[l],am[r]);
				
				if(k<=asd){
					if(k&1) k=(k+1)/2, x=par[x].fst;
					else k=k/2, x=par[x].snd;
				}
				
				else if(am[l]>am[r]){
					k=asd/2 + (k-asd);
					x=par[x].fst;
				}
				
				else{
					k=asd/2 + (k-asd);
					x=par[x].snd;
				}
			}
		}
		
		if(bad)cout<<"none\n";
		else cout<<k<<"\n";
	}
}