/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.05.22 16:08:41
**/

// H(0,0) = 1

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

constexpr int MOD = 1e9 + 7;
struct mint {
private:
    long long x;
public:
    mint(long long x = 0) :x((MOD+x)%MOD) {}
    mint(std::string &s) {
        long long z = 0;
        for (int i = 0; i < s.size(); i++) {
            z *= 10;
            z += s[i] - '0';
            z %= MOD;
        }
        this->x = z;
    }
    mint& operator+=(const mint &a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint &a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint &a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint& operator/=(const mint &a) {
        long long n = MOD - 2;
        mint u = 1, b = a;
        while (n > 0) {
            if (n & 1) {
                u *= b;
            }
            b *= b;
            n >>= 1;
        }
        return *this *= u;
    }
    mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint &a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint &a) const {
        mint res(*this);
        return res *= a;
    }
    mint operator/(const mint &a) const {
        mint res(*this);
        return res /= a;
    }
    friend std::ostream& operator<<(std::ostream &os, const mint &n) {
        return os << n.x;
    }
    bool operator==(const mint &a) const {
        return this->x == a.x;
    }
};
// comb (前計算O(NlogMOD) クエリO(1))
struct Combination {
private:
    int N;
    // pow
    mint pow(mint k, ll n) {
        mint res = 1;
        while (n > 0) {
            if (n & 1) {
                res *= k;
            }
            k *= k;
            n >>= 1;
        }
        return res;
    }
public:
    vector< mint > FACT, IFACT;
    // nCk
    Combination(int n) : N(n) {
        FACT.resize(n + 1);
        IFACT.resize(n + 1);
        FACT[0] = 1;
        IFACT[0] = 1;
        for (int i = 1; i <= n; i++) {
            FACT[i] = FACT[i - 1] * i;
            IFACT[i] = pow(FACT[i], MOD - 2);
        }
    }
    mint comb(int n, int r) {
        if (n < 0 || r < 0 || r > n) return 0;
        if (r > n / 2) r = n - r;
        return FACT[n] * IFACT[n - r] * IFACT[r];
    }
};
pair<int,int> input(string s) {
    pair<int,int> res = {0,0};
    bool fst = true;
    for (int i = 2; i < s.size(); i++) {
        if (s[i] >= '0' && s[i] <= '9' && fst) {
            res.first *= 10;
            res.first += s[i] - '0';
        }
        else if (s[i] == ',') {
            fst = false;
        }
        else if (s[i] >= '0' && s[i] <= '9') {
            res.second *= 10;
            res.second += s[i] - '0';
        }
    }
    return res;
}
int main() {
    int t;cin >> t;
    Combination cmb(2000000);
    for (int i = 0; i < t; i++) {
        string s;cin >> s;
        auto p = input(s);
        if (s[0] == 'C') {
            cout << cmb.comb(p.first,p.second) << endl;
        }
        else if (s[0] == 'P') {
            cout << cmb.comb(p.first,p.second) * cmb.FACT[p.second] << endl;
        }
        else {
            cout << cmb.comb(max(0,p.first+p.second-1),p.second) << endl;
        }
    }
    return 0;
}