#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define BE(x) x.begin(), x.end()

const ll m = 1000000007;
const ll max_n = 2000000;

vector<ll> inv(max_n+1), fact(max_n+1), finv(max_n+1);
bool pre = true;

void comb_pre() {
    inv[1]  = 1;
    fact[0] = fact[1] = 1;
    finv[0] = finv[1] = 1;
    for (ll i = 2; i <= max_n; i++) {
        inv[i]  = m - inv[m%i] * (m/i) % m; // inverse for i
        fact[i] = fact[i-1] * i % m;        // i!
        finv[i] = finv[i-1] * inv[i] % m;   // inverse for i!
    }
}

ll comb (ll n, ll k) {
    if (pre) {
        comb_pre();
        pre = false;
    }
    if (n<k || n<0 || k<0)
        return 0;
    else
        return fact[n] * (finv[k] * finv[n-k] % m) % m;
} // n and k up to about 10^7 // pre:O(max_n), query:O(1)

int main() {
    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        string s;
        cin >> s;

        int nb = 2, ne = 3;
        while (s[ne] != ',') ne++;
        int kb = ne+1, ke = ne+2;
        while (s[ke] != ')') ke++;
        ll n = stoll(s.substr(nb, ne-nb));
        ll k = stoll(s.substr(kb, ke-kb));

        if (s[0] == 'C') cout << comb(n,k) << endl;
        if (s[0] == 'P') cout << comb(n,k) * fact[k] % m << endl;
        if (s[0] == 'H') cout << comb(n+k-1,k) << endl;
    }
}