#include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
using ui64 = uint_fast64_t;
#define REP(i, n) for (i64 (i) = 0; (i) < (n); ++(i))
#define FOR(i, a, b) for (i64 (i) = (a); (i) < (b); ++(i))

struct Combination {
    using i64 = int_fast64_t;
    using ui64 = uint_fast64_t;
    vector<ui64> fac, finv, inv;
    int MOD, MAX;
    bool expand_to_minus;
    Combination(int MOD = (int)1e9 + 7, int MAX = 2020202, bool expand_to_minus = true) :
        MOD(MOD), MAX(MAX), expand_to_minus(expand_to_minus) {
        fac.assign(MAX, 0);
        finv.assign(MAX, 0);
        inv.assign(MAX, 0);
        fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
        for (i64 i = 2; i < MAX; ++i) {
            fac[i] = fac[i - 1] * i % MOD;
            inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
            finv[i] = finv[i - 1] * inv[i] % MOD;
        }
    }
    ui64 nCr(i64 n, i64 r) {
        if (r == 0) return 1;
        if (r <  0) return 0;
        if (n <  0) return expand_to_minus ? ((r % 2 ? -1 : 1) * nCr(-n + r - 1, r)) : 0;
        if (n == 0 or n < r) return 0;
        return (fac[n] * ((finv[n - r] * finv[r]) % MOD)) % MOD;
    }
    ui64 nPr(i64 n, i64 r) {
        if (r < 0 or n < r) return 0;
        else return (fac[n] * finv[n - r]) % MOD;
    }
    ui64 nHr(i64 n, i64 r) {
        if (n == 0 and r == 0) return 1;
        else return nCr(n + r - 1, r);
    }
};

signed main() {

    Combination Z;

    int N;
    cin >> N;

    REP(i, N) {
        string S;
        cin >> S;
        char t;
        int a, b;
        sscanf(S.c_str(), "%c(%d,%d)", &t, &a, &b);
        if (t == 'C') {
            cout << Z.nCr(a, b) << endl;
        } else if (t == 'P') {
            cout << Z.nPr(a, b) << endl;
        } else {
            cout << Z.nHr(a, b) << endl;
        }
    }

}