#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
typedef long long ll;

const ll mod = 1e9 + 7;

vector<long long> F, invF;
long long modpow(long long a, long long b, long long mod) {
	long long ret = 1;
	for (; b > 0; a = a * a % mod, b /= 2) if (b & 1) ret = ret * a % mod;
	return ret;
}
long long modinv(long long a, long long mod) {
	return modpow(a, mod - 2, mod);
}
void initF(int n) {
	F.resize(n, 1);
	invF.resize(n, 1);
	rep2(i, 1, n) F[i] = i * F[i - 1] % mod;
	invF[n - 1] = modinv(F[n - 1], mod);
	repr(i, n - 1) invF[i] = invF[i + 1] * (i + 1) % mod;
}
long long P(int a, int b) {
	if (a < b || a < 0 || b < 0) return 0;
	return F[a] * invF[a - b] % mod;
}
long long C(int a, int b) {
	if (a < b || a < 0 || b < 0) return 0;
	return P(a, b) * invF[b] % mod;
}
long long H(int a, int b) {
	return C(a + b - 1, b);
}

int main() {
	initF(1010101);
	int T;
	cin >> T;
	rep(i_, T) {
		string s;
		cin >> s;
		char q = s[0];
		s = s.substr(2, s.size() - 3);
		int p = s.find(',');
		int n = stoi(s.substr(0, p));
		int k = stoi(s.substr(p + 1));

		if (q == 'C') {
			cout << C(n, k) << endl;
		} else if (q == 'P') {
			cout << P(n, k) << endl;
		} else {
			cout << H(n, k) << endl;
		}
	}
}