mod = int(1e9) + 7

maxf = 2000000 # <-- input factional limitation

def doubling(n, m):
    y = 1
    base = n
    tmp = m
    while tmp != 0:
        if tmp % 2 == 1:
            y *= base
            y %= mod
        base *= base
        base %= mod
        tmp //= 2
    return y

def inved(a):
    x, y, u, v, k, l = 1, 0, 0, 1, a, mod
    while l != 0:
        x, y, u, v = u, v, x - u * (k // l), y - v * (k // l)
        k, l = l, k % l
    return x % mod

fact = [1 for _ in range(maxf+1)]
invf = [1 for _ in range(maxf+1)]

for i in range(maxf):
    fact[i+1] = (fact[i] * (i+1)) % mod
invf[-1] = inved(fact[-1])
for i in range(maxf, 0, -1):
    invf[i-1] = (invf[i] * i) % mod

T = int(input())
L, R = "", ""
for _ in range(T):
    L, R = input().split(',')
    val = L[0]
    L = int(L[2:])
    R = int(R[:-1])
    if val == 'C':
        if L < R:
            print(0)
        else:
            print(fact[L]*invf[L-R]*invf[R]%mod, flush=True)
    elif val == 'P':
        if L < R:
            print(0)
        else:
            print(fact[L]*invf[L-R]%mod, flush=True)
    elif val == 'H':
        if L == 0:
            print(1*(R==0))
        else:
            print(fact[L+R-1]*invf[R]*invf[L-1]%mod, flush=True)