import sys
input = sys.stdin.readline

mod = 10 ** 9 + 7
n = 2*10**6+5
fact = [1] * (n + 1)
invfact = [1] * (n + 1)
for i in range(1, n):
    fact[i + 1] = ((i+1) * fact[i]) % mod
invfact[n] = pow(fact[n], mod - 2, mod)
for i in range(n - 1, -1, -1):
    invfact[i] = invfact[i + 1] * (i + 1) % mod

def comb(n, r):
    if n < 0 or r < 0 or n - r < 0:
        return 0
    return fact[n] * invfact[r] * invfact[n - r] % mod


T = int(input())
for _ in range(T):
    a, b = input().split(",")
    flag = a[0]
    a = int(a[2:])
    b = int(b[:-2])
    if flag == "C":
        print(comb(a, b))
    elif flag == "P":
        if a >= b:
            print(fact[a] * invfact[a - b] % mod)
        else:
            print(0)
    else:
        if a == b == 0:
            print(1)
        else:
            print(comb(a+b-1, b))