//#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;
Graph G;
vll dist;
vector<bool> seen;
set<pair<ll, ll>> S;

ll gcd(ll(a), ll(b)) {
	ll c = a;
	while (a % b != 0) {
		c = a % b;
		a = b;
		b = c;
	}
	return b;
}
vector<ll> fact, factinv, inv;
ll mod = 1e9 + 7;
void prenCkModp(ll n) {
	fact.resize(n + 5);
	factinv.resize(n + 5);
	inv.resize(n + 5);
	fact.at(0) = fact.at(1) = 1;
	factinv.at(0) = factinv.at(1) = 1;
	inv.at(1) = 1;
	for (ll i = 2; i < n + 5; i++) {
		fact.at(i) = (fact.at(i - 1) * i) % mod;
		inv.at(i) = mod - (inv.at(mod % i) * (mod / i)) % mod;
		factinv.at(i) = (factinv.at(i - 1) * inv.at(i)) % mod;
	}

}
ll nCk(ll n, ll k) {
	if (n < k) return 0;
	return fact.at(n) * (factinv.at(k) * factinv.at(n - k) % mod) % mod;
}
ll nPk(ll n,ll k){
	if (n < k) return 0;
	return fact.at(n) * (factinv.at(n - k) % mod) % mod;
}

int main() {
	ll N;
	cin>>N;
	prenCkModp(1e6*2);
	rep(i,N){
		string S;
		cin>>S;
		ll A=0,B=0;
		rep(k,S.size()){
			if(S[k]=='('){
				k++;
				while(S[k]!=','){
					A+=S[k]-'0';
					A*=10;
					k++;
				}
				k++;
				while(S[k]!=')'){
					B+=S[k]-'0';
					B*=10;
					k++;
				}
				
			}
			
		}
		A/=10;B/=10;
		if(S[0]=='C'){
			cout<<nCk(A,B)<<endl;
		}
		else if(S[0]=='P'){
			cout<<nPk(A,B)<<endl;
		}
		else{
			cout<<nCk(A+B-1,B)<<endl;
		}
	}


}