package main import ( "bufio" "fmt" "os" "sort" "strconv" ) func out(x ...interface{}) { fmt.Println(x...) } var sc = bufio.NewScanner(os.Stdin) func getInt() int { sc.Scan() i, e := strconv.Atoi(sc.Text()) if e != nil { panic(e) } return i } func getInts(N int) []int { ret := make([]int, N) for i := 0; i < N; i++ { ret[i] = getInt() } return ret } func getString() string { sc.Scan() return sc.Text() } // min, max, asub, absなど基本関数 func max(a, b int) int { if a > b { return a } return b } func min(a, b int) int { if a < b { return a } return b } func asub(a, b int) int { if a > b { return a - b } return b - a } func abs(a int) int { if a >= 0 { return a } return -a } func lowerBound(a []int, x int) int { idx := sort.Search(len(a), func(i int) bool { return a[i] >= x }) return idx } func upperBound(a []int, x int) int { idx := sort.Search(len(a), func(i int) bool { return a[i] > x }) return idx } const mod = 1000000007 func mpow(p, n int) int { ret := 1 x := p for n != 0 { if n%2 == 1 { ret *= x ret %= mod } n /= 2 x = x * x % mod } return ret } const size = 2000100 var frac [size]int var ifrac [size]int func initFrac() { frac[0] = 1 for i := 1; i < size; i++ { frac[i] = frac[i-1] * i % mod } ifrac[size-1] = mpow(frac[size-1], mod-2) for i := size - 2; i >= 0; i-- { ifrac[i] = ifrac[i+1] * (i + 1) % mod } } func nCk(n, k int) int { if n < k || k < 0 { return 0 } return frac[n] * ifrac[k] % mod * ifrac[n-k] % mod } func nPk(n, k int) int { if k < 0 || n < k { return 0 } return frac[n] * ifrac[n-k] % mod } func nHk(n, k int) int { if n == 0 && k == 0 { return 1 } return nCk(n+k-1, k) } func main() { sc.Split(bufio.ScanWords) sc.Buffer([]byte{}, 1000000) initFrac() T := getInt() for i := 0; i < T; i++ { s := getString() switch s[0] { case 'C': var n, k int fmt.Sscanf(s, "C(%d,%d)", &n, &k) out(nCk(n, k)) case 'P': var n, k int fmt.Sscanf(s, "P(%d,%d)", &n, &k) out(nPk(n, k)) case 'H': var n, k int fmt.Sscanf(s, "H(%d,%d)", &n, &k) out(nHk(n, k)) } } }