p (_,0) = 1
p (n,k) | n<k  = 0
      | True = product[n-k+1..n]
c (n,k) = p (n,k) `div` product[1..k]
h (n,k) = c ((n+k-1),k)
f ch = case ch of
          'C' -> c
          'P' -> p
          'H' -> h
main=do
    getLine
    getContents>>=mapM_ print.map(\s->(f(head s)((read::String->(Int,Int))(tail s)))`mod`1000000007).lines