#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;

#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
/*----------------------------------------*/
const int MOD = 1000000007;

long long euler_phi(long long num) {
  long long res = num;
  for (long long i = 2; i * i <= num; ++i) {
    if (num % i == 0) {
      res -= res / i;
      while (num % i == 0) num /= i;
    }
  }
  if (num > 1) res -= res / num;
  return res;
}

long long mod_pow(long long base, long long exponent) {
  long long res = 1;
  while (exponent > 0) {
    if (exponent & 1) (res *= base) %= MOD;
    (base *= base) %= MOD;
    exponent >>= 1;
  }
  return res;
}

long long mod_inv(long long a) { return mod_pow(a % MOD, euler_phi(MOD) - 1); }

const int MAX = 10000000;
long long fact[MAX + 1], fact_inv[MAX + 1];
void nCk_init(int num = MAX) {
  fact[0] = 1;
  FOR(i, 1, MAX + 1) fact[i] = fact[i - 1] * i % MOD;
  fact_inv[MAX] = mod_inv(fact[MAX]);
  for (int i = MAX; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i % MOD;
}

inline long long nCk(int n, int k) {
  if (n < 0 || n < k || k < 0) return 0;
  return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD;
}

inline long long nPk(int n, int k) {
  if (n < 0 || n < k || k < 0) return 0;
  return fact[n] * fact_inv[n - k] % MOD;
}

inline long long nHk(int n, int k) {
  if (n < 0 || k < 0) return 0;
  return (k == 0 ? 1 : nCk(n + k - 1, k));
}

int main() {
  cin.tie(0); ios::sync_with_stdio(false);
  // freopen("input.txt", "r", stdin);

  nCk_init(1000000);
  int t; cin >> t;
  while (t--) {
    string s; cin >> s;
    string n = "";
    int idx = 2;
    for (;; ++idx) {
      char c = s[idx];
      if (c == ',') break;
      n += c;
    }
    string k = s.substr(idx + 1);
    if (s[0] == 'C') cout << nCk(stoi(n), stoi(k));
    else if (s[0] == 'P') cout << nPk(stoi(n), stoi(k));
    else cout << nHk(stoi(n), stoi(k));
    cout << '\n';
  }
  return 0;
}