#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair pii; typedef pair pll; const int INF = 1e9; const ll LINF = 1e18; template ostream& operator << (ostream& out,const pair& o){ out << "(" << o.first << "," << o.second << ")"; return out; } template ostream& operator << (ostream& out,const vector V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; } template ostream& operator << (ostream& out,const vector > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; } template ostream& operator << (ostream& out,const map mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; } /* 問題文============================================================ ================================================================= 解説============================================================= ================================================================ */ const ll MAX_N = 3e6 + 10; const ll MOD = 1e9+7; ll Inv[MAX_N]; ll fact[MAX_N]; ll factInv[MAX_N]; void Inv_init(){ Inv[1] = 1; for(int i = 2; i < MAX_N; i++) { Inv[i] = Inv[MOD%i] * (MOD - MOD/i) % MOD; } } void fact_init(){ fact[0] = fact[1] = factInv[0] = factInv[1] = 1; for(int i = 2; i < MAX_N; i++){ fact[i] = (fact[i-1] * i) % MOD; factInv[i] = (factInv[i-1] * Inv[i])%MOD; } } // a^b % MOD; ll powmod(ll a,ll b) {ll res=1;a%=MOD; for(;b;b>>=1){if(b&1)res=res*a%MOD;a=a*a%MOD;}return res;} // 逆元 1/a % MOD ll inversemod(ll a) { return powmod(a,MOD - 2);} ll nCr(int n,int r) { if(n < r) return 0; return (fact[n] * (factInv[r] * factInv[n-r] % MOD)) % MOD; } ll nPr(int n,int r){ if(n < r) return 0; return (fact[n]*factInv[n-r])%MOD; } ll nHr(int n,int r){ if(n == 0 && r == 0) return 1; return nCr(n+r-1,r); } void init(){ Inv_init(); fact_init(); } ll solve(){ ll res = 0; char com,c; int N,K; cin >> com >> c >> N >> c >> K >> c; if(com == 'C'){ res = nCr(N,K); } if(com == 'P'){ res = nPr(N,K); } if(com == 'H'){ res = nHr(N,K); } return res; } int main(void) { cin.tie(0); ios_base::sync_with_stdio(false); init(); ll T; cin >> T; while(T--){ cout << solve() << endl; } return 0; }