#include <fstream>

using namespace std;

ifstream fin("diamant.in");
ofstream fout("diamant.out");

const int MOD = 10000, NMax = 20, SMax = 40000;
int N, M, X, Cost[NMax * NMax + 5], ct, DP[2][2  * SMax + 5], oo = 2 * SMax + 2;

int Norm(int sum)
{
    sum += SMax;

    if(sum < 0)
        return oo;
    else if(sum > 2 * SMax)
        return oo;

    return sum;
}

int main()
{
    fin >> N >> M >> X;

    for(int i = 1; i <= N; i++)
        for(int j = 1; j <= M; j++)
            Cost[++ct] = i * j;

    DP[0][SMax] = 1;

    for(int code = 1; code <= ct; code++)
    {
        int line = (code & 1), linePred = ((code - 1) & 1), cost = Cost[code];

        for(int sum = -SMax; sum <= SMax; sum++)
            DP[line][Norm(sum)] = (DP[linePred][Norm(sum)] + DP[linePred][Norm(sum + cost)] + DP[linePred][Norm(sum - cost)]) % MOD;
    }
    fout << DP[ct & 1][Norm(X)] << '\n';

    fin.close();
    fout.close();

    return 0;
}