#include <cstdio>
using namespace std;
long a[441010],n,m,k,val;
int main()
{
    long i,j,t;
    freopen("diamant.in","r",stdin);
    freopen("diamant.out","w",stdout);
    scanf("%ld%ld%ld",&n,&m,&k);
    val=n*(n+1)*m*(m+1)/4;a[0]=1;
    for(i=1;i<=n;i++){
        for(j=1;j<=m;j++){
            for(t=2*val;t>=0;t--){a[t+i*j]=(a[t+i*j]+a[t])%10000;a[t+2*i*j]=(a[t+2*i*j]+a[t])%10000;}
                         }
                     }
    if((k+val>=0)&&(k-val<=0)){printf("%ld",a[k+val]);}
    else{printf("0");}
}