#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = (int)(n); i >= 0; i--)
#define FOR(i,n,m) for(int i = (int)(n); i < int(m); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = MOD - 1;
const ll LLINF = 4e18;

struct mint {
private:
    ll x;
public:
    mint(ll x = 0) :x(x%MOD) {}
    mint& operator+=(const mint a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint operator+(const mint a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint a) const {
        mint res(*this);
        return res *= a;
    }
    friend ostream& operator<<(ostream& os, const mint& n) {
        return os << n.x;
    }
};

// comb (前計算O(NlogMOD) クエリO(1))
vector<mint> FACT, IFACT;

mint comb(int n, int r) {
    if (n < 0 || r < 0 || r > n)return 0;
    if (r > n / 2) r = n - r;
    return FACT[n] * IFACT[n - r] * IFACT[r];
}
mint perm(int n, int r) {
    if (n < 0 || r < 0 || r > n)return 0;
    return FACT[n] * IFACT[n - r];
}
mint h(int n, int r) {
    n = n + r - 1;
    if (n < 0 || r < 0 || r > n)return 0;
    if (r > n / 2) r = n - r;
    return FACT[n] * IFACT[n - r] * IFACT[r];
}

//pow
template<typename T, typename U>
T pow(T k, U n) {
    T x = 1;
    while (n > 0) {
        if (n & 1) {
            x *= k;
        }
        k *= k;
        n >>= 1;
    }
    return x;
}

int main() {
    const int MAX_N = 2000000;
    FACT.resize(MAX_N + 1);
    IFACT.resize(MAX_N + 1);
    FACT[0] = 1;
    IFACT[0] = 1;
    for (int i = 1; i <= MAX_N; i++) {
        FACT[i] = FACT[i - 1] * i;
        IFACT[i] = pow(FACT[i], MOD-2);
    }
    int t; cin >> t;
    REP(i, t) {
        string s; cin >> s;
        char c = s[0];
        int a=0, b=0;
        int k = 2;
        while (s[k] != ',') {
            a *= 10;
            a += s[k] - '0';
            k++;
        }
        k++;
        while (s[k] != ')') {
            b *= 10;
            b += s[k] - '0';
            k++;
        }
        switch (c) {
            case 'C':
                cout << comb(a, b) << endl;
                break;
            case 'P':
                cout << perm(a, b) << endl;
                break;
            case 'H':
                cout << h(a, b) << endl;
                break;
        }
    }
    getchar(); getchar();
}