#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define forn(i,a,b) for (int i = a; i <= b; i++)
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
#define er erase
#define in insert
#define pi pair <int, int>
# define sz(x) (int)((x).size())
#define inf 1000000000
#define int long long
const ll mod = 10000;
const int N = 2e5 + 11;
int x, n, m, a[170000], b[170000];

int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(); cerr.tie(); cout.tie();
ifstream cin("diamant.in");
ofstream cout("diamant.out");
	cin>>n>>m>>x;
	a[44100]=1;
	if(abs(x)<=44100)
	forn(i,1,n){
		forn(j,1,m){
			memcpy(b,a,sizeof(a));
			for(int k = 88000; k >= 0; k--){
				a[k]=b[k-i*j]+b[k]+b[k+i*j];
				a[k]%=mod;
			}
		}
	}
	if(abs(x)<=44100)cout<<a[44100+x];else cout<<"0";
return 0;
}