#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<pint> vpint;
#define rep(i,n) for(int i=0;i<(n);i++)
#define reps(i,f,n) for(int i=(f);i<(n);i++)
#define each(it,v) for(__typeof((v).begin()) it=(v).begin();it!=(v).end();it++)
#define all(v) (v).begin(),(v).end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define chmax(a, b) a = (((a)<(b)) ? (b) : (a))
#define chmin(a, b) a = (((a)>(b)) ? (b) : (a))
const int MOD = 1e9 + 7;
const int INF = 1e9;

const int MAX_N = 2000000;
ll inv[MAX_N + 10];
ll fac[MAX_N + 10], facInv[MAX_N + 10];
class MATH{
public:
	void init(void){
		inverse();
		factroial();
	}
	void inverse(void){
		inv[1] = 1;
		for (int i = 2; i <= MAX_N; ++i){
			// inv[i] = MOD - (MOD / i) * inv[MOD % i] % MOD;
			inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
		}
	}
	void factroial(void){
		fac[0] = facInv[0] = 1;
		for (int i = 1; i <= MAX_N; ++i){
			fac[i] = (fac[i - 1] * i) % MOD;
			facInv[i] = (facInv[i - 1] * inv[i]) % MOD;
		}
	}
	ll nCr(ll n, ll r){// n! / r!*(n-r)!
		if(r < 0 || r > n) return 0;
		ll ret = fac[n];
		(ret *= facInv[r]) %= MOD;
		(ret *= facInv[n - r]) %= MOD;
		return ret;
	}
	ll nHr(ll n, ll r){// nHr = n+r-1 C r = (n+r-1)! / r! * (n-1)!
		if(n == 0 && r == 0) return 1;
		ll ret = fac[n + r - 1];
		(ret *= facInv[r]) %= MOD;
		(ret *= facInv[n - 1]) %= MOD;
		return ret;
	}
	ll nPr(ll n, ll r){//nPr = n! / (n-r)!
		if(r < 0 || r > n) return 0;
		ll ret = fac[n];
		(ret *= facInv[n - r]) %= MOD;
		return ret;
	}
};


int main(void){
	int t; cin >> t;
	MATH mt;
	mt.init();
	rep(i, t){
		char c;
		ll n, k;
		scanf(" %c(%lld,%lld)\n", &c, &n, &k);
		if(c == 'C'){
			printf("%lld\n", mt.nCr(n, k) % MOD);
		}else if(c == 'P'){
			printf("%lld\n", mt.nPr(n, k) % MOD);
		}else{
			printf("%lld\n", mt.nHr(n, k) % MOD);
		}
	}
	return 0;
}