#include <stdio.h>

#define MOD	(1000000007)

long long int c,m ,fact[1000010];

int H(int n, int r){
	
	c = (fact[n+r-1])%MOD;
	m = (fact[r]%MOD * fact[n-1]%MOD)%MOD;
	
	return (int)((c/m)%MOD);
}

int P(int n, int r){
	
	if(r>n){	return 0;}
	
	c = fact[n]%MOD;
	m = fact[n-r]%MOD;
	
	return (int)((c/m)%MOD);
}

int C(int n, int r){
	
	if(r>n){	return 0;	}
	
	
	c = P(n,r);
	m = fact[r]%MOD;
	
	return (int)((c/m)%MOD);
}

int main(void){
	int i,T;
	int ans[100010];
	
	fact[0] = 1;
	for(i=1;i<=1000000;i++){
		fact[i] = ((fact[i-1]%MOD)*(i%MOD))%MOD;
	}
	
	scanf("%d", &T);
	
	for(i=0;i<T;i++){
		int p, a=0,b=0;
		char s[30];
		scanf("%s", s);
		
		for(p=2;s[p]!=',';p++){
			a = a*10 + (s[p]-'0');
		}
		for(p=p+1;s[p] != ')';p++){
			b = b*10 + (s[p]-'0');
		}
		
		
		
		if(s[0] == 'C'){
			ans[i] = C(a,b);
		}else if(s[0] == 'P'){
			ans[i] = P(a,b);
		}else{
			ans[i] = H(a,b);
		}
	}
	
	for(i=0;i<T;i++){
		printf("%d\n", ans[i]);
	}
	return 0;
}