#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
typedef long long ll;

ll mod = 1000000007;
ll f[101010],rf[101010];

ll inv(ll x){
    ll res=1;
    ll k=mod-2;
    while(k){
        if(k&1) res = (res*x) % mod;
        x = (x*x) % mod;
        k = k >> 1;
    }
    return res;
}

void init(){
    f[0]=1;
    rep(i,1,101010) f[i] = (f[i-1]*i) % mod;
    rf[101010 - 1] = inv(f[101010 - 1]);
    rrep(i, 101010 - 2, 0) rf[i] = (rf[i + 1] * (i + 1)) % mod;
}

ll C(int n, int k){
    if (k < 0 || n < k) return 0;
    ll a = f[n];    // n!
    ll b = rf[n-k];  // (n-k)!
    ll c = rf[k];    // k!
    
    ll bc = (b*c) % mod;
    
    return (a*bc) % mod;
    
}

ll P(int n, int k) {
    if (k < 0 || n < k) return 0;
    ll a = f[n]; // = n!
    ll b = rf[n - k]; // = (n-k)!
    return (a * b) % mod;
}

ll H(int n, int k) {
    if (n == 0 && k == 0) return 1;
    return C(n + k - 1, k);
}
int main(){
    init();
    int T;
    cin >> T;
    rep(t, 0, T) {
        string s; cin >> s;
        char c; int a, b;
        sscanf(s.c_str(), "%c(%d,%d)", &c, &a, &b);

        int ans;
        if (c == 'C') ans = C(a, b);
        else if (c == 'P') ans = P(a, b);
        else ans = H(a, b);
        printf("%d\n", ans);
    }
    return 0;
}