# coding:utf-8

MOD = 1000000007
fact = [0]*2000010
inv = [0]*2000010
factr = [0]*2000010
inv[1]=1
fact[0]=1
factr[0]=1
for i in range(2, 2000010, 1):
    inv[i] = inv[MOD%i]*(MOD-MOD//i)%MOD
for i in range(1,2000010):
    fact[i] = fact[i-1]*i%MOD
    factr[i] = factr[i-1]*inv[i]%MOD


def c(n, c):
    if c<0 or c>n:return 0
    return factr[c]*fact[n]*factr[n-c]%MOD


def p(n, c):
    if c<0 or c>n:return 0
    return fact[n]*factr[n-c]%MOD


def h(p, q):
    if p==0 and q==0:return 1
    return c(p+q-1, q)


T = int(input())
for i in range(T):
    s = input()
    x = s[0]
    n, k = map(int, s[2:-1].split(','))
    if x=="C": print(c(n, k))
    if x=="P": print(p(n, k))
    if x=="H": print(h(n, k))