MOD = 10 ** 9 + 7
N = 1000100
fact = [0 for _ in range(N)]
invfact = [0 for _ in range(N)]
fact[0] = 1
for i in range(1, N):
    fact[i] = fact[i - 1] * i % MOD

invfact[N - 1] = pow(fact[N - 1], MOD - 2, MOD)

for i in range(N - 2, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % MOD

def nCk(n, k):
    if k < 0 or n < k:
        return 0
    else:
        return (fact[n] * invfact[k] % MOD) * invfact[n - k] % MOD

def nPk(n, k):
    if k < 0 or n < k:
        return 0
    else:
        return fact[n] * invfact[n - k] % MOD

def nHk(n, k):
    return nCk(n + k - 1, k)

for _ in range(int(input())):
    S = input()
    n, k = map(int, S[2:-1].split(","))
    if S[0] == "C":
        print(nCk(n, k))
    elif S[0] == "P":
        print(nPk(n, k))
    else:
        print(nHk(n, k))