#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const int MAX = 3e6;
ll fac[MAX + 1], ifac[MAX + 1];

ll Pow(ll a, ll b) {
	ll res = 1;
	while (b) {
		if (b & 1) res = res * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return res;
}

ll C(int n, int k) {
	if (k < 0 || n < k) return 0;
	return fac[n] * ifac[k] % mod * ifac[n - k] % mod;
}

ll P(int n, int k) {
	if (k < 0 || n < k) return 0;
	return fac[n] * ifac[n - k] % mod;
}

ll H(int n, int k) {
	if (n == 0 && k == 0) return 1;
	return C(n + k - 1, k);
}

int main()
{
	fac[0] = 1;
	for (int i = 1; i <= MAX; i++) fac[i] = fac[i - 1] * i % mod;
	ifac[MAX] = Pow(fac[MAX], mod - 2);
	for (int i = MAX - 1; i >= 0; i--) ifac[i] = ifac[i + 1] * (i + 1) % mod;

	int T; cin >> T;
	while (T--) {
		char c;
		int N, K;
		string S;
		cin >> S;
		sscanf(S.c_str(), "%c(%d,%d)", &c, &N, &K);
		if (c == 'C') {
			cout << C(N, K) << endl;
		}
		else if (c == 'P') {
			cout << P(N, K) << endl;
		}
		else if (c == 'H') {
			cout << H(N, K) << endl;
		}
		else {
			exit(EXIT_FAILURE);
		}
	}
}