#include <iostream>
using namespace std;

const long long MOD = 1000000007;

template <int mod>
struct ModInt{
  int n;
  ModInt():n(0){}
  ModInt(int n_):n(n_ >= 0 ? n_%mod : mod - ((-n_)%mod) ){}

  ModInt &operator+=(const ModInt &p){
    if((n+=p.n) >= mod)n-=mod;
    return *this;
  }
  ModInt &operator-=(const ModInt &p){
    n+=mod-p.n;
    if(n >= mod)n-=mod;
    return *this;
  }
  ModInt &operator*=(const ModInt &p){
    n = (int) ((1LL*n*p.n)%mod);
    return *this;
  }
  ModInt &operator/=(const ModInt &p){
    *this *= p.inverse();
    return *this;
  }
  ModInt operator-() const {return ModInt(-n);}
  ModInt operator+(const ModInt &p) const {return ModInt(*this) += p;}
  ModInt operator-(const ModInt &p) const {return ModInt(*this) -= p;}
  ModInt operator*(const ModInt &p) const {return ModInt(*this) *= p;}
  ModInt operator/(const ModInt &p) const {return ModInt(*this) /= p;}

  bool operator==(const ModInt &p) const {return n==p.n;}
	bool operator<(const ModInt &p) const {return n<p.n;}
	bool operator>(const ModInt &p) const {return n>p.n;}
	bool operator>=(const ModInt &p) const {return n>=p.n;}
	bool operator<=(const ModInt &p) const {return n<=p.n;}
  bool operator!=(const ModInt &p) const {return n!=p.n;}

  ModInt inverse() const {
    int a = n,b = mod,u = 1,v = 0;
    while(b){
      int t = a/b;
      a -= t*b; swap(a,b);
      u -= t*v; swap(u,v);
    }
    return ModInt(u);
  }

  ModInt pow(int64_t z) const {
    ModInt ret(1),mul(n);
    while(z > 0){
      if(z & 1) ret *= mul;
      mul *= mul;
      z >>= 1;
    }
    return ret;
  }

  friend ostream &operator<<(ostream &os, const ModInt &p){
    return os << p.n;
  }
  friend istream &operator>>(istream &is, ModInt &a){
    int64_t t;
    is >> t;
    a = ModInt<mod> (t);
    return (is);

  }
};
using mint = ModInt<MOD>;

mint kaijo[2000100];
void init(int n){
  kaijo[0] = kaijo[1] = 1;
  for(int i = 2; n >= i; i++){
    kaijo[i] = kaijo[i-1]*(mint)i;
  }
}

mint C(int n, int r){
  if(n < r)return 0;
  return kaijo[n]/(kaijo[n-r]*kaijo[r]);
}
mint P(int n, int r){
  if(n < r)return 0;
  return kaijo[n]/kaijo[n-r];
}
mint H(int n, int r){
  if(n == 0 && r == 0)return 1;
  return C(n+r-1, r);
}

int main(){
  init(2000010);
  int q;cin>>q;
  char _;
  for(int i = 0; q > i; i++){
    char c;cin>>c>>_;
    int a,b;cin>>a>>_>>b>>_;
    if(c == 'C')cout << C(a,b) << endl;
    else if(c == 'P')cout << P(a,b) << endl;
    else cout << H(a,b) << endl;
  }
}