#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

const int MOD = 1e9 + 7;
const int N_MAX = 2e6;

vector<long long> factorial;
vector<long long> inv_factorial;

void make_factorials() {
	factorial.assign(N_MAX + 1, 1);
	for (int i = 2; i <= N_MAX; i++) {
		factorial[i] = factorial[i-1] * i % MOD;
	}

	int p2 = MOD - 2;
	inv_factorial.assign(N_MAX + 1, 1);
	for (int i = 2; i <= N_MAX; i++) {
		long long tmp = factorial[i];
		for (int j = 0; j <= 30; j++) {
			if ((p2 >> j) & 1) {
				inv_factorial[i] = inv_factorial[i] * tmp % MOD;
			}
			tmp = tmp * tmp % MOD;
		}
	}

	// for (int i = 0; i <= 10; i++) {
	// 	printf("%2d, %10lld, %10lld\n", i, factorial[i], inv_factorial[i]);
	// }
}

int calc_p(int n, int k) {
	if (n < k) {
		return 0;
	}
	return factorial[n] * inv_factorial[n - k] % MOD;
}

int calc_c(int n, int k) {
	if (n < k) {
		return 0;
	}
	return factorial[n] * inv_factorial[k] % MOD * inv_factorial[n - k] % MOD;
}

int calc_h(int n, int k) {
	if (n == 0 && k == 0) {
		return 1;
	}
	return calc_c(n + k - 1, k);
}


int main() {
	make_factorials();

	int t, n, k, ans;
	char c;

	scanf("%d\n", &t);
	for (int i = 0; i < t; i++) {
		scanf("%c(%d,%d)\n", &c, &n, &k);
		switch (c) {
		case 'P': ans = calc_p(n, k); break;
		case 'C': ans = calc_c(n, k); break;
		case 'H': ans = calc_h(n, k); break;
		default: break;
		}
		// printf("%d: %d%c%d = %d\n", i, n, c, k, ans);
		printf("%d\n", ans);
	}
	return 0;
}