#include <bits/stdc++.h>
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 {
    const int MOD = (int)1e9 + 7;
    vector<ui64> fac, finv, inv;
    Combination(int MAX) {
        fac.assign(MAX, 0);
        finv.assign(MAX, 0);
        inv.assign(MAX, 0);
        fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
        for (int 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(int n, int r) {
    if (n < r or r < 0) return 0;
    return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
    }
    ui64 P(int n, int r) {
        if (n < r or r < 0) return 0;
        return (fac[n] * finv[n - r]) % MOD;
    }
    ui64 H(int n, int r) {
        if (n == 0 and r == 0) return 1;
        return C(n + r - 1, r);
    }
};

int main() {
  Combination Z(2001001);
  int Q;
  scanf("%d\n" , &Q);
  while(Q--){
    int N, K; char c = '!';
    scanf("%c(%d,%d)\n", &c, &N, &K);
    if(c == 'C') cout << (Z.C(N , K)) << "\n";
    if(c == 'P') 
      cout << Z.P(N, K) << "\n";
    if(c == 'H') 
      cout << Z.H(N, K) << "\n";
  }
}