#include <bits/stdc++.h>

 using namespace std;

 const int MOD = ;

 const int maxn = ;

 int C[maxn+][maxn+];

 int main()

 {

     memset(C,,sizeof(C));

     C[][] = ;

     for(int i=;i<=maxn;i++) {

         C[i][] = C[i][i] = ;

         for(int j=;j<i;j++)

             C[i][j] = (C[i-][j]+C[i-][j-])%MOD;

     }

     int t;

     cin>>t;

     int kase = ;

     while(t--) {

         int n,m,k,sum = ;

         cin>>n>>m>>k;

         for(int S=;S<;S++) {

             int b = ;

             int r = n;

             int c = m;

             if(S&) {r--;b++;}

             if(S&) {r--;b++;}

             if(S&) {c--;b++;}

             if(S&) {c--;b++;}

             if(b&) sum = (sum + MOD - C[r*c][k]) % MOD;

             else sum = (sum + C[r*c][k])%MOD;

         }

         printf("Case %d: %d\n",kase++,sum);

     }

     return ;

 }