#include <bits/stdc++.h>

#define MOD 10000
using namespace std;

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

int dp[2][100000];

int main()
{
    int n, m, x;
    fin >> n >> m >> x;

    if(x + 45000 < 0)
    {
        fout << 0 << '\n';
        return 0;
    }
    dp[0][45000] = 1;
    int lst = 0;
    for(int i = 1; i <= n; ++i)
        for(int j = 1; j <= m; ++j)
        {
            int num = i * j;
            for(int val = 0; val <= 100000; ++val)
                if(dp[lst][val])
                {
                    dp[1 - lst][val + num] = (dp[1 - lst][val + num] + dp[lst][val]);
                    if(val - num >= 0)
                        dp[1 - lst][val - num] = (dp[1 - lst][val - num] + dp[lst][val]);
                }
            for(int val = 0; val <= 100000; ++val)
                dp[1 - lst][val] = (dp[1 - lst][val] + dp[lst][val]) % MOD, dp[lst][val] = 0;
            lst = 1 - lst;
        }

    fout << dp[lst][x + 45000] << '\n';
    return 0;
}