#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
/* 
PascalCase  クラス名
camelCase   メソッド名，関数名，変数名
snake_case  ファイル名，名前空間，std のメソッド名，変数名，型名に準じる場合
SNAKE_CASE	マクロ名，static const 定数，列挙体
*/

#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), facInv(MAX + 1);

long long getInverse(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++)
    {
        facInv[i] = getInverse(fac[i]);
    }
}

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

    long long a = fac[n], b = facInv[n - r], c = facInv[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 = facInv[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)
    {
        string s; cin >> s;
        char c; long long n, k;
        sscanf(s.c_str(), "%c(%ld,%ld)", &c, &n, &k);

        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;
}