import re

MOD = 10**9+7

def ncr(n, r):
    if n - r < r:
        r = n-r
    if r == 0:
        return 1
    if r == 1:
        return n

    numerator = [0 for i in range(r)]
    denominator = [0 for i in range(r)]

    for k in range(r):
        numerator[k] = n - r + k + 1
        denominator[k] = k + 1
    
    for p in range(2, r+1):
        pivot = denominator[p-1]
        if pivot > 1:
            offset = (n-r) % p
        for k in range(p-1, r, p):
            numerator[k-offset] /= pivot
            denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result = (result*numerator[k]) % MOD

    return result

def npr(n, r):
    ans = 1
    for i in xrange(r):
        ans = (ans*(n-i))%MOD
    return ans

for i in xrange(input()):
    q = raw_input()
    n, r = map(int, re.findall('\d+', q))
    if q[0] == 'C':
        print ncr(n, r)
    elif q[0] == 'P':
        print npr(n, r)
    else:
        print ncr(n+r-1, r)