#define nume "diamant"

#include<cstdio>
#include<iostream>
#include<fstream>
#include<vector>
#include<cstring>
#include<string>
#include<sstream>
#include<cstdlib>
#include<queue>
#include<set>
#include<map>
#include<ctime>
#include<list>
#include<algorithm>

using namespace std;

//#define _PARSARE_
#ifdef _PARSARE_
#define DIM 8192
char ax[DIM+16];
int idx;
inline void cit_int(int &x)
{
    x=0;
    while((ax[idx]<'0' || ax[idx]>'9') && (ax[idx]!='-'))
        if(++idx==DIM)fread(ax, 1, DIM, stdin), idx=0;

    int neg=0;
    if(ax[idx]=='-') {
        neg=1;
        if(++idx==DIM)fread(ax, 1, DIM, stdin),idx=0;
    }

    while(ax[idx]>='0' && ax[idx]<='9') {
        x=x*10+ax[idx]-'0';
        if(++idx==DIM)fread(ax,1, DIM, stdin),idx=0;
    }
    if(neg) x=-x;
}
#else
ifstream fin (nume  ".in");
#endif //_PARSARE_
ofstream fout(nume  ".out");
//#ifndef ONLINE_JUDGE
//	freopen("input.txt","r",stdin);
//#endif


int n,m,x;
//vector<int> G[100000+10];

#define MOD 10000
#define DIM 44100

int s, k, dp[2][DIM*2+10];

int main()
{
#ifdef _PARSARE_
    freopen(nume  ".in","r",stdin);
    cit_uint(n);
#endif
    fin>>n>>m>>x;

    int maxsum=44100;
//    for(int i=1; i<=n; ++i)
//        for(int j=1; j<=m; ++j)
//            maxsum+=i*j;
//    cerr<<maxsum;

    if (abs(x)>maxsum) {
        fout<<0<<'\n';
        return 0;
    }

    bool b=true;
    dp[b][DIM]=1;
    b=!b;
    for(int i=1; i<=n; ++i) {
        for(int j=1; j<=m; ++j) {
            for(int k=0; k<DIM*2; ++k) {
                dp[b][k]=dp[!b][k];
                if(k>=i*j)//pun 0
                    dp[b][k]=(dp[b][k]+dp[!b][k-i*j])%MOD;
                if(k+i*j<=DIM*2)//nu depaseste
                    dp[b][k]=(dp[b][k]+dp[!b][k+i*j])%MOD;
            }
            b=!b;
        }
    }
    fout<<dp[!b][x + DIM];
//    cerr<<dp[!b][x + DIM];



    fout.close();
    return 0;
}