#include<cstdio>
using namespace std;
const int MOD=1000007,SIZEN=500;
typedef long long LL;
int N,M,K;
LL C[SIZEN][SIZEN]={0};
void prepare()
{
	C[0][0]=1;
	for(int i=1;i<=450;i++)
	{
		C[i][0]=1;
		for(int j=1;j<=i;j++) C[i][j]=(C[i-1][j-1]+C[i-1][j])%MOD;
	}
}
int cnt=0;
void work()
{
	LL sum=0;
	for(int S=0;S<16;S++)
	{
		int b=0,r=N,c=M;
		if(S&1){r--;b++;}
		if(S&2){r--;b++;}
		if(S&4){c--;b++;}
		if(S&8){c--;b++;}
		if(b&1) sum=(sum+MOD-C[r*c][K])%MOD;
		else sum=(sum+MOD+C[r*c][K])%MOD;
	}
	printf("Case %d:%lld\n",cnt,sum);
}
int main()
{
	freopen("Cheerleaders.in","r",stdin);
	freopen("Cheerleaders.out","w",stdout);
	int T;
	scanf("%d",&T);
	prepare();
	while(T)
	{
		T--;
		cnt++;
		scanf("%d%d%d",&N,&M,&K);
		work();
	}
	return 0;
}