#include using namespace std; using i64 = int_fast64_t; using ui64 = uint_fast64_t; #define REP(i, n) for (i64 (i) = 0; (i) < (n); ++(i)) #define FOR(i, a, b) for (i64 (i) = (a); (i) < (b); ++(i)) struct Combination { using i64 = int_fast64_t; using ui64 = uint_fast64_t; static const ui64 MAX = 2020202; ui64 MOD; vector fac, finv, inv; bool expand_to_minus; Combination(i64 MOD = (i64)1e9 + 7, bool expand_to_minus = true) : MOD(MOD), expand_to_minus(expand_to_minus) { fac.resize(MAX , 0); finv.resize(MAX , 0); inv.resize(MAX , 0); fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1; for (i64 i = 2; i < MAX; ++i) { fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } ui64 C(i64 n, i64 k) { if (n < k || k < 0) return 0; return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } ui64 P(i64 N, i64 K) { return N >= K ? (fac[N] * finv[N - K]) % MOD : 0; } ui64 H(i64 N, i64 K) { return (N == 0 && K == 0) ? 1 : C(N + K - 1 , K); } }; signed main() { cin.tie(0); ios::sync_with_stdio(false); Combination Z; int N; cin >> N; REP(i, N) { char in; cin >> in; char dust; cin >> dust; i64 a, b; cin >> a >> dust >> b >> dust; if (in == 'C') { cout << Z.C(a, b) << endl; } else if (in == 'P') { cout << Z.P(a, b) << endl; } else { cout << Z.H(a, b) << endl; } } }