#include <cstdio>
#define mod 10000

using namespace std;

int n,m,x,v[2][70000]={0},val;

inline int abs(int a)
{
    return ((a>0)? a: -a );
}

int main()
{
    int i,j,k;
    freopen("diamant.in","r",stdin);
    freopen("diamant.out","w",stdout);
    scanf("%d %d %d",&n,&m,&x);
    val=n*(n+1)*m*(m+1)/4;
    if(x>val)
    {
        printf("0\n");
        return 0;
    }
    v[0][0]=1;
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=m;j++)
        {
            for(k=val;k>=0;--k)
                {
                    v[1][k]=v[0][k]+v[0][abs(k-i*j)]+v[0][k+i*j];
                }
            for(k=0;k<=val;k++)
                {
                    v[0][k]=v[1][k];
                    v[1][k]=0;
                    v[0][k]%=mod;
                }
        }
    }
    printf("%d\n",v[0][abs(x)]);
    return 0;
}