#include <cstdio>
#define REP(s,n) for(int i=s;i<n;i++)
typedef long long ll;
ll mod=1e9+7;
ll f[1<<21],n,k,t,s,u,e;char c;
ll inv(ll v){
  for(e=mod-2,s=1,u=v%mod;e;u=u*u%mod,e/=2)if(e%2)s=s*u%mod;
  return s;
}
ll comb(ll n,ll k){
  return n<k||k<0||n<0?0:(f[n]*inv(f[k])%mod)*inv(f[n-k])%mod;}
int main(){
  scanf("%lld",&t);
  REP(f[0]=1,1<<21)f[i]=f[i-1]*i%mod;
  REP(0,t){
    scanf("%*[\n]%c(%lld,%lld)",&c,&n,&k);
    if(c%2)
      k=comb(n,k);
    if(c==72)
      k=n?comb(n+k-1,k):!k;
    if(c==80)
      k=n>=k?f[n]*inv(f[n-k])%mod:0;
    printf("%lld\n",k);
  }
}