#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))

const int MOD = (int)1e9 + 7;

vector<ui64> fac, finv, inv;
void COMinit(int MAX) {
  fac.resize(MAX, 0);
  finv.resize(MAX, 0);
  inv.resize(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 k){
  if (n < k or k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}

int main() {
  COMinit(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 << (C(N , K)) << "\n";
    if(c == 'P') 
      cout << (N >= K ? (fac[N] * finv[N - K]) % MOD : 0) << "\n";
    if(c == 'H') 
      cout << ((N == 0 && K == 0) ? 1 : C(N + K - 1 , K)) << "\n";
  }
}