class Combination:
    """階乗とその逆元のテーブルをO(N)で事前作成し、組み合わせの計算をO(1)で行う"""
    def __init__(self, n, MOD):
        self.fact = [1]
        for i in range(1, n + 1):
            self.fact.append(self.fact[-1] * i % MOD)
        self.inv_fact = [0] * (n + 1)
        self.inv_fact[n] = pow(self.fact[n], MOD - 2, MOD)
        for i in reversed(range(n)):
            self.inv_fact[i] = self.inv_fact[i + 1] * (i + 1) % MOD
        self.MOD = MOD
    
    def factorial(self, k):
        """k!を求める O(1)"""
        return self.fact[k]

    def inverse_factorial(self, k):
        """k!の逆元を求める O(1)"""
        return self.inv_fact[k]

    def permutation(self, k, r):
        """kPrを求める O(1)"""
        if k < r:
            return 0
        return (self.fact[k] * self.inv_fact[k - r]) % self.MOD

    def combination(self, k, r):
        """kCrを求める O(1)"""
        if k < r:
            return 0
        return (self.fact[k] * self.inv_fact[k - r] * self.inv_fact[r]) % self.MOD


import re
import sys
input = sys.stdin.readline


t = int(input())
query = [re.split('[(,)]', input()) for i in range(t)]
MOD = 10 ** 9 + 7
comb = Combination(2 * 10 ** 6 + 10, MOD)

for i in range(t):
    char, n, r, _ = query[i]
    n = int(n)
    r = int(r)
    if char == "P":
        print(comb.permutation(n, r))
    elif char == "C":
        print(comb.combination(n, r))
    else:
        if n == r and n == 0:
            print(1)
        else:
            print(comb.combination(n + r - 1, r))