#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <ctime>
#include <cstdio>
#include <functional>
#include <set>
#include <sstream>
#include <map>
#include <queue>

using namespace std;
 
const double eps=1e-10;

const int dy[]={-1,-1,0,1,1, 1, 0,-1};
const int dx[]={ 0, 1,1,1,0,-1,-1,-1};

const long long mod=1000000000+7;

//a^b
long long mod_pow(long long a,long long b){
	long long res=1;

	while(b>0){
		if((b&1)==1) res=(res*a)%mod;
		b >>=1;
		a=(a*a)%mod;
	}
	return res;
}

//a/b
long long mod_div(long long a,long long b){
	return a*mod_pow(b,mod-2)%mod;
}

long long fact[10000001];

int main()
{

	fact[0]=fact[1]=1;
	for(long i=2;i<10000001;i++){
		fact[i]=(i*fact[i-1])%mod;
	}

	int t;
	cin>>t;


	for(int i=0;i<t;i++){
		char c;
		cin>>c;
		if(c=='C'){
			long long n,k;
			char dummy;
			cin>>dummy>>n>>dummy>>k>>dummy;

			if(n<k) cout<<0<<endl;
			else{
				
				long long a=mod_div(fact[n],fact[k]);
				long long b=mod_div(a,fact[n-k]);
				cout<<b<<endl;
			}
		}else if(c=='P'){
			long long n,k;
			char dummy;
			cin>>dummy>>n>>dummy>>k>>dummy;

			if(n<k) cout<<0<<endl;
			else{
				
				cout<<mod_div(fact[n],fact[n-k])<<endl;
			}

		}else{

			//H(n,k)=C(n+k-1,k)

			long long n,k;
			char dummy;
			cin>>dummy>>n>>dummy>>k>>dummy;

			if(n==0 && k==0) cout<<1<<endl;
			else if(n+k-1-k<0) cout<<0<<endl;
			else{
				
				long long a=mod_div(fact[n+k-1],fact[k]);
				long long b=mod_div(a,fact[n+k-1-k]);

				cout<<b<<endl;
			}

		}

	}

	return 0;
}