#line 1 "ez.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/117"
#include <iostream>
#line 2 "/home/wa_haya_exe/CP_Library/C++/ModPrime.hpp"
#include <array>
#include <algorithm>
#ifndef TEMPLATE
template <class T> inline T sqr(const T x){ return x * x; }
template <class T> inline T Mod(T x, const T m) {
    x %= m;
    return x < 0 ? x + m : x;
}
#else
using namespace zia_qu;
#endif
template <int lim> struct ModPrime {
private:
    const int64_t mod;
    std::array<int64_t, lim> f{}, rf{};
	const int len = std::min(mod, (int64_t) lim);
    int64_t inv(int64_t x) {
        int64_t res = 1, k = mod - 2;
		while(k) {
			if(k & 1) {
				res = Mod(res * x, mod);
			}
			x = Mod(sqr(x), mod);
			k >>= 1;
		}
		return res;
    }
public:
    ModPrime(const int64_t mod_): mod(mod_) {
        f[0] = 1;
		for(int i = 0; ++i < len;) {
			f[i] = Mod(f[i - 1] * i, mod);
		}
		rf[len - 1] = inv(f[len - 1]);
		for(int i = len; --i > 0;) {
			rf[i - 1] = Mod(rf[i] * i, mod);
		}
    }
    int64_t C(const int n, const int k) const {
		if(k < 0 || n < k) {
			return 0;
		}
		const int64_t a = f[n], b = rf[n - k], c = rf[k], bc = Mod(b * c, mod);
		return Mod(a * bc, mod);
	}
	int64_t P(const int n, const int k) const {
		if (k < 0 || n < k) {
			return 0;
		}
		const int64_t a = f[n], b = rf[n - k];
		return Mod(a * b, mod);
	}
	int64_t H(const int n, const int k) const {
		if (n == 0 && k == 0) {
			return 1;
		}
		return C(n + k - 1, k);
	}
};
/**
 * @brief ModPrime
 */
#line 4 "ez.cpp"
constexpr int mod = 1e9 + 7;
ModPrime<(int) 2e7 + 1> mp(mod);
int main() {
    std::cin.tie(nullptr) -> sync_with_stdio(false);
    int t;
    std::cin >> t;
    while(t--) {
        char c, tmp;
        int n, k;
        std::cin >> c >> tmp >> n >> tmp >> k >> tmp;
        std::cout << (c == 'C' ? mp.C(n, k) : c == 'P' ? mp.P(n, k) : mp.H(n, k)) << '\n';
    }
}