#include <cstdio>
#include <iostream>
#include <iomanip>
#include <vector>

using namespace std;
using lint = long long;
constexpr int MOD = 1000000007;

class Factorial {
private:
	vector<lint> fac, inv, finv;

	void build(int N) {
		fac[0] = fac[1] = 1; inv[1] = 1; finv[0] = finv[1] = 1;

		for (int i = 2; i < N; i++) {
			fac[i] = fac[i - 1] * i % MOD;
			inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
			finv[i] = finv[i - 1] * inv[i] % MOD;
		}
	}

public:
	Factorial(int N = 110000) : fac(N + 1), inv(N + 1), finv(N + 1) { build(N + 1); }

	lint Cmod (int n, int k) {
		if (n < k || k < 0) return 0LL;
		return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
	}

	lint Pmod(int n, int k) {
		if (n < k || k < 0) return 0LL;
		return fac[n] * finv[n - k] % MOD;
	}
};


struct init {
	init() {
		cin.tie(nullptr); ios::sync_with_stdio(false);
		cout << fixed << setprecision(10);
	}
} init_;

int main() {

	Factorial F(3000000);

	int T;
	scanf("%d\n", &T);

	for (int i = 0; i < T; i++) {
		char type;
		int n, k;
		scanf("%c(%d,%d)\n", &type, &n, &k);

		if (type == 'C') {
			printf("%lld\n", F.Cmod(n, k));
		}
		else if (type == 'P') {
			printf("%lld\n", F.Pmod(n, k));
		}
		else {
			printf("%lld\n", F.Cmod(n + k - 1, k));
		}
	}

	return 0;
}