#define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair i_i; typedef pair ll_i; typedef pair d_i; typedef pair ll_ll; typedef pair d_d; struct edge { int u, v; ll w; }; ll MOD = 1000000007; ll _MOD = 1000000009; double EPS = 1e-10; ll extgcd(ll a, ll b, ll& x, ll& y) { if (b == 0) { x = (a >= 0) ? 1 : -1; y = 0; return abs(a); } else { ll res = extgcd(b, a % b, y, x); y -= (a / b) * x; return res; } } ll mod_inverse(ll a, ll m) { ll x, y; extgcd(a, m, x, y); return (m + x % m) % m; } vector f(2000001); ll P(ll n, ll k) { if (n < k) return 0; return (f[n] * mod_inverse(f[n - k], MOD)) % MOD; } ll C(ll n, ll k) { if (n < 0) return 0; return (P(n, k) * mod_inverse(f[k], MOD)) % MOD; } int main() { f[0] = 1; for (int i = 1; i <= 2000000; i++) f[i] = (f[i - 1] * i) % MOD; int T; cin >> T; cin >> ws; while (T--) { char c; int N, K; scanf("%c(%d,%d)", &c, &N, &K); cin.ignore(); if (c == 'C') cout << C(N, K) << endl; if (c == 'P') cout << P(N, K) << endl; if (c == 'H') cout << C(N + K - 1, N - 1) << endl; } }