#include <bits/stdc++.h>
#define A(i) A[i+50000]
#define B(i) B[i+50000]
#define mod 10000
using namespace std;
ifstream fin ("diamant.in");
ofstream fout ("diamant.out");
int lmax=45000,lmin=-lmax,nro=0,n,m,x,A[100002],B[100002];

int main()
{
    fin>>n>>m>>x;
    B(0)=1;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j){
            memcpy(A,B,sizeof(B));
            for(int k=lmax;k>=lmin;--k)
                B(k)=(A(k)+A(k-i*j)+A(k+i*j))%mod;
        }
    fout<<B(x)<<endl;
    return 0;
}