#include <bits/stdc++.h>

#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, init, n) for (int i = init; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define Cout(obj) cout << obj << endl
#define Size(obj) (int)(obj).size()
#define fcout cout << fixed << setprecision(10)
#define fi first
#define se second

using namespace std;
using lint = long long int;
using vvlint = vector<vector<long long int>>;
using vlint = vector<long long int>;
using vvint = vector<vector<int>>;
using vint = vector<int>;

const int MOD = 1e9 + 7;
const int iINF = 1e9;
const long long int llINF = 1e18;
const double PI = acos(-1.0);

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

const int MAX = 2000000;

vector<long long> fac(MAX + 1), ifac(MAX + 1);

long long getInv(long long n) {
    long long res = 1, p = MOD - 2;

    while (p != 0) {
        if (p & 1) res = (res * n) % MOD;

        n = (n * n) % MOD;
        p >>= 1;
    }

    return res;
}

void init() {
    fac[0] = 1;

    for (int i = 1; i <= MAX; i++) {
        fac[i] = (fac[i - 1] * i) % MOD;
    }

    for (int i = 0; i <= MAX; i++) {
        ifac[i] = getInv(fac[i]);
    }
}

long long comb(long long n, long long r) {
    if (r < 0 || n < r) return 0;

    long long a = fac[n], b = ifac[n - r], c = ifac[r];
    long long bc = (b * c) % MOD;

    return (a * bc) % MOD;
}

long long perm(long long n, long long r) {
    if (r < 0 || n < r) return 0;

    long long a = fac[n], b = ifac[n - r];

    return (a * b) % MOD;
}

long long dupc(long long n, long long r) {
    if (n == 0 && r == 0) return 1;

    return comb(n + r - 1, r);
}

int main() {
    init();

    int T;
    cin >> T;

    REP(i, T) {
        char c, q, w, e;
        long long n, k;
        cin >> c >> q >> n >> w >> k >> e;
        long long ans;
        if (c == 'C') {
            ans = comb(n, k);
        } else if (c == 'P') {
            ans = perm(n, k);
        } else {
            ans = dupc(n, k);
        }

        cout << ans << endl;
    }

    return 0;
}