#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>
#include <cstring>

/* 
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 ll = long long 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 = 3000000;

vector<ll> fac(MAX + 1);
vector<ll> modFac(MAX + 1);

ll powMod(ll n, ll p)
{
    ll ans = 1;

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

        n = n * n % MOD;

        p = p >> 1;
    }

    return ans;
}

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

    return (fac[n] * modFac[r]) % MOD * modFac[n - r] % MOD;
}

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

    return ((fac[n + r - 1] * modFac[n - 1]) % MOD * modFac[r]) % MOD;
}

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

    return (fac[n] * modFac[n - r]) % MOD;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    fac[0] = 1;
    modFac[0] = 1;

    REP(i, MAX)
    {
        fac[i + 1] = (fac[i] * (i + 1)) % MOD;
        modFac[i + 1] = modFac[i] * powMod(i + 1, MOD - 2) % MOD;
    }

    int T;
    cin >> T;

    REP(i, T)
    {
        char com;
        int n, r;

        scanf(" %c(%d,%d)", &com, &n, &r);

        if(com == 'C')
        {
            Cout(comb(n, r));
        }
        else if(com == 'P')
        {
            Cout(perm(n, r));
        }
        else
        {
            Cout(dupc(n, r));
        }
    }

    return 0;
}