#include<cstdio>
#define mod 1000007
using namespace std;
typedef long long ll;
ll T,num,n,m,k,ans;
ll c[500][600]={0};
void work(ll n,ll m,ll k){
	ans=c[n*m][k];
	ans-=c[(n-1)*m][k]*2+c[n*(m-1)][k]*2;
	ans+=c[(n-2)*m][k]+c[(n-1)*(m-1)][k]*4+c[n*(m-2)][k];
	ans-=c[(n-1)*(m-2)][k]*2+c[(n-2)*(m-1)][k]*2;
	ans+=c[(n-2)*(m-2)][k];
	ans+=-1*(ans/mod)*mod+mod;
	return;
}
int main(){
	freopen("Cheerleaders.in","r",stdin);
	freopen("Cheerleaders.out","w",stdout);
	for (int i=0;i<=400;i++) c[i][0]=1;
	for (int i=1;i<=400;i++){
		for (int j=1;j<=i;j++)
			c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod;
	}
	scanf("%lld",&T);
	for (int i=1;i<=T;i++){
		scanf("%d%d%d",&n,&m,&k);
		work(n,m,k);
		printf("Case %d: %lld\n",i,(ans+mod)%mod);
	}
	return 0;
}