#include "bits/stdc++.h"
using namespace std;

#define REP(i, n) for(int i=0; i<(n); i++)
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define MAX 2222222

#define int long long
int T;
int mod = (int)1e9+7;
int inv[MAX], fact[MAX], finv[MAX];
int perm(int n, int k, int mod=(int)1e9+7) {
    if (k < 0 || n < k) return 0;
    return fact[n] * finv[n-k] % mod;
}
int comb(int n, int k, int mod=(int)1e9+7) {
    if (k < 0 || n < k) return 0;
    return fact[n] * finv[n-k] % mod * finv[k] % mod;
}
int hcomb(int n, int k, int mode=(int)1e9+7) {
    if (n == 0 && k == 0) return 1;
    return comb(n+k-1, k);
}
int pymod(int i, int j) {
    return (i % j + j) % j;
}
signed main()
{
    inv[0] = inv[1] = fact[0] = finv[0] = 1;
    FOR(i,2,MAX) inv[i] = pymod(-mod/i * inv[mod%i], mod);
    FOR(i,1,MAX) {
        fact[i] = i * fact[i-1] % mod;
        finv[i] = inv[i] * finv[i-1] % mod;
    }

    cin >> T;
    char c;
    int n, k;
    REP(i,T) {
        scanf(" %c(%lld,%lld)", &c, &n, &k);
        int ret = 0;
        if (c == 'P') ret = perm(n, k);
        else if (c == 'C') ret = comb(n, k);
        else ret = hcomb(n, k);
        cout << ret << endl;
    }
    return 0;
}