#include<cstdio>
#include<cctype>
#include<string>
#define rep(i,a) for(int i=0;i<(a);++i)
#define repd(i,a) for(int i=(a);i>=0;--i)

typedef long long ll;

const ll mod = 1000000007, MAX_N = 2000000;

int T;
ll fact[MAX_N+1], factinv[MAX_N+1];

ll extgcd( ll a, ll b, ll &x, ll &y )
{
	int d = b;

	if( b )
	{
		d = extgcd( b, a%b, y, x );
		y -= a/b*x;
	}
	else
		x = 1, y = 0;

	return d;
}

ll divMod( ll a, ll b, ll m )
{
	ll x, y;
	extgcd( b, m, x, y );

	return ((a*x)%m+m)%m;
}

ll perm( int n, int r )
{ return n<r?0:fact[n]*factinv[n-r] % mod; }

ll comb( int n, int r )
{ return n<r?0:fact[n]*factinv[r] % mod * factinv[n-r] % mod; }

ll homo( int n, int r )
{ return r?comb( n+r-1, r ):1; }

int main()
{
	fact[0] = 1;
	rep( i, MAX_N )
		fact[i+1] = (i+1)*fact[i] % mod;

	factinv[MAX_N] = divMod( 1, fact[MAX_N], mod );
	repd( i, MAX_N-1 )
		factinv[i] = (factinv[i+1]*(i+1)) % mod;

	scanf( "%d", &T );
	rep( i, T )
	{
		char S[41];
		scanf( "%s", S );

		int n, r;
		ll ans = 0;		
		
		if( sscanf( S, "C(%d,%d)", &n, &r ) == 2 )
			ans = comb(n,r);
		if( sscanf( S, "P(%d,%d)", &n, &r ) == 2 )
			ans = perm(n,r);
		if( sscanf( S, "H(%d,%d)", &n, &r ) == 2 )
			ans = homo(n,r);

		printf( "%lld\n", ans );
	}

	return 0;
}