from collections import *
from itertools import *
from functools import *
from heapq import *
# import sys,math
# input = sys.stdin.readline

class combination():
    
    def __init__(self,N,p):
        
        
        self.fact = [1, 1]  # fact[n] = (n! mod p)
        self.factinv = [1, 1]  # factinv[n] = ((n!)^(-1) mod p)
        self.inv = [0, 1]  # factinv 計算用
        self.p = p
        
        for i in range(2, N + 1):
            self.fact.append((self.fact[-1] * i) % p)
            self.inv.append((-self.inv[p % i] * (p // i)) % p)
            self.factinv.append((self.factinv[-1] * self.inv[-1]) % p)
        

    def cmb(self,n, r):
        if (r < 0) or (n < r):
            return 0
        r = min(r, n - r)
        return self.fact[n] * self.factinv[r] * self.factinv[n-r] % self.p
        
mod = 10**9 + 7

c = combination(3*10**6,mod)

def H(n,r):
    if n==0:
        return 0
    return c.cmb(n+r-1,r)
def C(n,r):
    if n<r:
        return 0
    if n==r:
        return 1
    return c.cmb(n,r)
def P(n,r):
    if n<r:
        return 0
    return c.fact[n]*c.factinv[n-r]%mod


for _ in range(int(input())):
    
    X = list(input().replace('(',' ').replace(')','').replace(',',' ').split())
    n = int(X[1])
    r = int(X[2])
    if X[0]=='H':
        print(H(n,r))
    if X[0]=='C':
        print(C(n,r))
    if X[0]=='P':
        print(P(n,r))