#include <bits/stdc++.h>

#define pb push_back

#define mp make_pair

#define fi first

#define se second

#define all(a) (a).begin(), (a).end()

#define fillchar(a, x) memset(a, x, sizeof(a))

#define huan printf("\n")

#define debug(a,b) cout<<a<<" "<<b<<" "<<endl

#define ffread(a) fastIO::read(a)

using namespace std;

typedef long long ll;

typedef pair<int,int> pii;

//const int maxn=1e4+10;

const ll mod=1e6+;

const int maxn = ;

int C[maxn][maxn];

int n, m, k;

void init()

{

    C[][] = ;

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

    {

        C[i][] = ;

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

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

    }

}

int main()

{

    int t,kase=;

    init();

    scanf("%d",&t);

    while(t--)

    {

        scanf("%d%d%d",&m,&n,&k);

        int ans=C[n*m][k];

        ans=(ans-*C[(m-)*n][k]%mod+mod)%mod;

        ans=(ans-*C[(n-)*m][k]%mod+mod)%mod;

        ans=(ans+*C[(n-)*(m-)][k])%mod;

        ans=(ans+C[(n-)*m][k])%mod;

        ans=(ans+C[(m-)*n][k])%mod;

        ans=(ans-*C[(n-)*(m-)][k]%mod+mod)%mod;

        ans=(ans-*C[(m-)*(n-)][k]%mod+mod)%mod;

        ans=(ans+C[(m-)*(n-)][k])%mod;

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

    }

}