#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}

#define MD 1000000007

void extended_euclid(ll x,ll y,ll *c,ll *a,ll *b){
  ll a0,a1,a2,b0,b1,b2,r0,r1,r2,q;
  r0=x; r1=y; a0=1; a1=0; b0=0; b1=1;
  while(r1>0){
    q=r0/r1; r2=r0%r1; a2=a0-q*a1; b2=b0-q*b1;
    r0=r1; r1=r2; a0=a1; a1=a2; b0=b1; b1=b2;
  }
  *c=r0; *a=a0; *b=b0;
}

ll get_inv(ll n, ll p){
  ll a,b,c;
  extended_euclid(n,p,&c,&a,&b);
  if(a<p) a+=p;
  return a%p;
}


int fact[2000100], fact_inv[2000100];

ll C(int N, int K){
  if(K < 0 || K > N) return 0;
  return (ll)fact[N] * fact_inv[K] % MD * fact_inv[N-K] % MD;
}

ll P(int N, int K){
  if(K > N) return 0;
  return (ll)fact[N] * fact_inv[N-K] % MD;
}

ll H(int N, int K){
  if(N==0 && K==0) return 1;
  if(N==0) return 0;
  return C(N+K-1, K);
}

int main(){
  int i, j, k;
  int T, N, K, res;
  char c;

  fact[0] = 1;
  REP(i,1,2000100) fact[i] = (ll)fact[i-1] * i % MD;
  fact_inv[2000050] = get_inv(fact[2000050], MD);
  for(i=2000050-1;i>=0;i--) fact_inv[i] = (ll)fact_inv[i+1] * (i+1) % MD;

  reader(&T);
  while(T--){
    do{ mygc(c); }while(c <= ' ');
    reader(&N,&K);
    if(c=='C') res = C(N,K);
    if(c=='P') res = P(N,K);
    if(c=='H') res = H(N,K);
    writerLn(res);
  }

  return 0;
}