mod = 10**9 + 7
N = 5 * 10**6
fact = [1]*(N+1)
factinv = [1]*(N+1)

for i in range(2, N+1):
	fact[i] = fact[i-1] * i % mod

factinv[-1] = pow(fact[-1], mod-2, mod)
for i in range(N-1, 1, -1):
	factinv[i] = factinv[i+1] * (i+1) % mod

def cmb(a, b):
	if (a < b) or (b < 0):
		return 0
	return fact[a] * factinv[b] % mod * factinv[a-b] % mod

t = int(input())
for i in range(t):
	s = input()
	l, r = map(int,s[2:-1].split(","))
	if s[0] == "C":
		print(cmb(l, r))
	elif s[0] == "P":
		if l >= r:
			print(fact[l] * factinv[l-r] % mod)
		else:
			print(0)
	else:
		if l == r == 0:
			print(1)
		else:
			print(cmb(l+r-1, r))