#include <iostream>
#include <fstream>
#include <queue>
#include <cmath>
#include <algorithm>
#define mij 50000
#define mod 10000
using namespace std;
int n,m,x,nr,nra;
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;
    }*/
    //daca x e 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])%mod;
                //cout<<crt+k<<endl;
            }
            Max=Max+crt;
            Min=mij-(Max-mij);
            for (k=mij;k<=Max;k++)
                a[mij-(k-mij)]=a[k]=temp[k];
        }
    g<<a[x+mij]%mod;

}