#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}

ll kaijo[2000010];
void init() {
	kaijo[0] = 1;
	for (ll i = 1;i <= 2000000;i++)kaijo[i] = (kaijo[i - 1] * i) % N;
}
 
ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
}
 
ll Comb(ll n, ll k) {
	if (n < 0 || k < 0 || (n - k) < 0)return 0;
	ll b = kaijo[n];
	ll c = kaijo[n - k];
	ll d = kaijo[k];
	ll cd = (c*d) % N;
	return ((b%N)*(inv(cd,N-2)) % N) % N;
}

int main(void){
	int T;
	cin>>T;
	init();
	for(int i=0;i<T;i++){
		char x1,x2,x3,x4;
		ll n,k;
		cin>>x1>>x2>>n>>x3>>k>>x4;
		if(x1=='C'){
			cout<<Comb(n,k)<<endl;
		}
		else{
			if(x1=='H'){
				if(n==0 && k==0){
					cout<<1<<endl;
					continue;
				}
				cout<<Comb(n+k-1,k)<<endl;
			}
			else{
				if(n<k){
					cout<<0<<endl;
					continue;
				}
				ll tmp1 = kaijo[n];
				ll tmp2 = kaijo[n-k];
				tmp2 = inv(tmp2,N-2);
				cout<<(tmp1*tmp2)%N<<endl;
			}
		}
	}
	return 0;
}