import re
def combination_len(n,r,mod):
    return 0 if n<r else Fact[n]*Factr[r]*Factr[n-r]%mod

def repeated_combination_len(n,r,mod):
    return 1 if n==0 and r==0 else combination_len(n+r-1,r,mod)

def permutation_len(n,r,mod):
    return 0 if n<r else Fact[n]*Factr[n-r]%mod

Inv = [1]*2000000
Fact = [1]*2000000
Factr = [1]*2000000
Mod = 1000000007
for i in range(2,2000000):
    Inv[i] = (Mod-Mod/i)*Inv[Mod%i]%Mod
    Fact[i] = i*Fact[i-1]%Mod
    Factr[i] = Inv[i]*Factr[i-1]%Mod

m={"C":combination_len,"P":permutation_len,"H":repeated_combination_len}
for _ in range(input()):
    a,b,c = filter(len,re.split("\(|\)|,",raw_input()))
    print(m[a](int(b),int(c),Mod))