// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

template <typename T>
T power(T a, T n, T mod) {
  T res = 1;
  T tmp = n;
  T curr = a;
  while(tmp){
    if(tmp % 2 == 1){
      res = (T)((ll)res * curr % mod);
    }
    curr = (T)((ll)curr * curr % mod);
    tmp >>= 1;
  }
  return res;
}

ll fac[2000001], inv[2000001];

ll comb(ll n, ll k){
  if(n < k)return 0;
  ll res = fac[n];
  res = res * inv[k] % mod;
  res = res * inv[n-k] % mod;
  return res;
}

ll permu(ll n, ll k){
  if(n < k)return 0;
  ll res = fac[n];
  res = res * inv[n-k] % mod;
  return res;
}

ll h(ll n, ll k){
  if(n == 0 && k == 0)return 1;
  return comb(n + k - 1, k);
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  cin >> t;
  fac[0] = 1;
  FOR(i, 1, 2000001){
    fac[i] = i * fac[i-1] % mod;
  }
  inv[2000000] = power<ll>(fac[2000000], mod - 2, mod);
  for(int i = 1999999; i >= 0; i--){
    inv[i] = (i + 1) * inv[i+1] % mod;
  }
  rep(i, t){
    string s;
    cin >> s;
    string t = s.substr(2, sz(s) - 3);
    ll n, k;
    for(int j = 0; j < sz(t); j++){
      if(t[j] == ','){
        n = stol(t.substr(0, j));
        k = stol(t.substr(j+1, sz(t) - j - 1));
        break;
      }
    }

    if(s[0] == 'C')cout << comb(n, k) << endl;
    else if(s[0] == 'P')cout << permu(n, k) << endl;
    else cout << h(n, k) << endl;
  }
	return 0;
}