#include <iostream>
#include <fstream>
#include <cmath>
#include <algorithm>
#define mij 50000
#define mod 10000
using namespace std;
int n,m,x,nr;
int a[100000],temp[100000],Min,Max;
int main()
{
    int i,j;
    fstream f,g;
    f.open("diamant.in",ios::in);
    g.open("diamant.out",ios::out);
    f>>n>>m>>x;
    x=abs(x+0.0);
    nr=(n+1)*n*(m+1)*m/4;
    if (x>nr)
    {
        g<<0;
        return 0;
    }
    temp[0+mij]=a[mij+0]=1;
    int k,crt;
    Min=Max=mij;
    for (i=1;i<=n;i++)
        for (j=1;j<=m;j++)
        {
            crt=i*j;
            for (k=Min;k<=Max;k++)
            {
                temp[crt+k]=(a[k]+a[crt+k]+a[k+crt+crt])%mod;
                //cout<<crt+k<<endl;
            }
            Max=Max+crt;
            Min=Min-crt;
            for (k=Min;k<=Max;k++)
                 a[mij-(k-mij)]=a[k]=temp[k];
        }
    g<<a[x+mij]%mod;

}

/*
#include <cstdio>
using namespace std;

#define MAXV 45000
#define MOD 10000

const int Nmax = 1<<17;
const int Vmax = 45000;
const int Mod = 10000;

int N, M, X;
int A[Nmax], B[Nmax], Sum;

#define A (A+MAXV)
#define B (B+MAXV)
#define rest(x,y) ((x)-(x)/(y)*(y))

int Solve()
{
    int c = 0;

    A[0] = 1;
    for (int i=1;i<=N;++i)
        for (int j=1;j<=M;++j)
        {
            if (c % 2 == 0)
                for (int val=-Sum;val<=Sum;++val)
                {
                    B[val] = A[val]+A[val-i*j]+A[val+i*j];
                    B[val] = rest(B[val], MOD);
                }
            else
                for (int val=-Sum;val<=Sum;++val)
                {
                    A[val] = B[val]+B[val-i*j]+B[val+i*j];
                    A[val] = rest(A[val], MOD);
                }
            c++;
        }
    if ( c % 2 == 0 )
        return A[X];
    else
        return B[X];
}

int main(void)
{
    freopen("diamant.in", "rt", stdin);
    freopen("diamant.out", "wt", stdout);

    scanf("%d %d %d\n", &N, &M, &X);

    Sum = N*(N+1)*M*(M+1)/4;

    if ( ( X > Sum ) || ( -X > Sum ) )
        printf("0\n");
    else
        printf("%d\n", Solve() );

    return 0;
}
*/