#include <iostream>
#include <fstream>
#define MOD 10000

using namespace std;

int sum, m, n, x, dp[85000], dp1[85000];

int main()
{
    ifstream cin("diamant.in");
    ofstream cout("diamant.out");
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m >> x;
    if(x < 0) x = -x;
    if(x > 44100)
        {   cout << 0 << '\n';
            return 0;
        }
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++) sum = sum + i * j;

    dp[0] = 1;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            {   int val = i * j;
                for(int i=sum; i>=-sum; i--)
                    {   if(i >= 0 && i - val >= 0) dp1[i] = dp[i-val];
                        else if(i >= 0 && i - val < 0) dp1[i] = dp[i-val+44100];
                        else dp1[i+44100] = dp[i-val+44100];
                    }
                for(int i=-sum; i<=sum; i++)
                    {   if(i >= 0) dp[i] = (dp[i] + dp1[i] + dp[i+val]) % MOD;
                        else if(i < 0 && i+val >= 0) dp[i+44100] = (dp[i+44100] + dp1[i+44100] + dp[i+val]) % MOD;
                        else dp[i+44100] = (dp[i+44100] + dp1[i+44100] + dp[i+val+44100]) % MOD;
                    }
            }
    cout << dp[x] << '\n';
    return 0;
}