#include <sstream>
#include <iostream>
#define REP(i,s,n) for(int i=s;i<n;i++)
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
ll f[1<<21],n,k,t;
ll invmod(ll v) {
  ll sum=1,cur=v%mod;
  ll e=mod-2;
  for(;e;e/=2){
    if(e%2)sum=sum*cur%mod;
    cur=cur*cur%mod;
  }
  return sum;
}
ll comb(ll n,ll k){return n<k||k<0||n<0?0:(f[n]*invmod(f[k])%mod)*invmod(f[n-k])%mod;}
int main(){
  cin>>t;
  REP(i,f[0]=1,1<<21)f[i]=f[i-1]*i%mod;
  REP(l,0,t){
    string s;
    cin>>s;
    stringstream ss;
    ss<<s;
    char c=ss.get();
    ss.ignore();
    ss>>n;
    ss.ignore();
    ss>>k;
    switch(c) {
    case'C':
      k=comb(n,k);
      break;
    case'H':
      k=n==0?!k:comb(n+k-1,k);
      break;
    case'P':
      k=n>=k?f[n]*invmod(f[n-k])%mod:0;
    }
    cout<<k<<endl;
  }
}