#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define FORS(i,a,b) for(int i=(a);i<(b);++i)
#define PII pair<int,int>
#define VI vector<int>
#define VPII vector<PII>
#define all(x) x.begin(),b.end()
#define SZ(x) ((int)(x).size())
#define ll long long
#define MOD 10000 //998244353
const int inf=0x3f3f3f3f;
#define maxn 50005

int sol[2][maxn],vmax,n,m,x,l;

int main()
{
	freopen("diamant.in","r",stdin);
	freopen("diamant.out","w",stdout);
	cin>>n>>m>>x;
	vmax=1LL*(n*(n+1)/2)*(m*(m+1)/2);
	if(abs(x)>vmax)
		return cout<<0,0;
	sol[1][1]=1;
	FOR(i,1,n)
		for(int j=1;j<=m;++j,l^=1)
			FOR(k,0,vmax)
				sol[l][k]=(sol[l^1][abs(k-i*j)]+sol[l^1][k]+sol[l^1][k+i*j])%MOD;
	cout<<sol[l^1][abs(x)]%MOD;
}