#include <bits/stdc++.h>

using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
const int mod = 10000, V = 90000;
int n,m,X,dp[2][95000],a[405],len;

int main()
{
    int i,j,L,v;
    fin >> n >> m >> X;
    v = n*m*(n+1)*(m+1)/4;
    if(abs(X) > v) fout << "0\n";
    else
    {

    for(i = 1; i <= n; i++)
        for(j = 1; j <= m; j++)
            a[++len] = i*j;
    X = X+45000;
    L = 0;
    dp[0][V/2] = 1;
    for(i = 1; i <= len; i++)
    {
        L  = 1-L;
        for(j = 0; j <= V; j++)
        {
            dp[L][j] = dp[1-L][j];
            if(j >= a[i]) dp[L][j] += dp[1-L][j-a[i]];
            dp[L][j] += dp[1-L][j+a[i]];
            dp[L][j] %= mod;
        }
    }
    fout << dp[L][X] << "\n";
    }
    fout.close();
    return 0;
}