#include <bits/stdc++.h>
#define MOD 10000

using namespace std;
ifstream f("diamant.in");
ofstream g("diamant.out");
int a[2][160010],n,m,x,y=1;
long long val;
int main()
{
    f>>n>>m>>x;
    a[0][0]=a[0][1]=val=1;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            if(i==1 && j==1) continue;
            val+=i*j;
            for(int k=0; k<=val; k++)
            {
                a[y%2][k]=((a[(y+1)%2][k+i*j]+a[(y+1)%2][abs(k-i*j)])%MOD+a[(y+1)%2][k])%MOD;
            }
            y++;
        }
    }
    x=abs(x);
    if(x>160000)g<<0<<'\n';
    else g<<a[(y+1)%2][x]%MOD<<'\n';
    return 0;
}