#include<cstdio>
#include<algorithm>
#include<cstring>

#define XMAX 44100+20

int i,j,n,m,x,k,An[XMAX],Ap[XMAX],Bn[XMAX],Bp[XMAX],s;

#define A(i) (((i)<0)?(An[-(i)]):(Ap[(i)]))
#define B(i) (((i)<0)?(Bn[-(i)]):(Bp[(i)]))

using namespace std;
int main()
{
    freopen("diamant.in","r",stdin);
    freopen("diamant.out","w",stdout);
    scanf("%d%d%d",&n,&m,&x);
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
            s+=i*j;
    if(x>s || x<-s) {printf("0\n"); return 0;}
    A(0)=1;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++)
        {
            memcpy(Bn,An,sizeof(An));
            memcpy(Bp,Ap,sizeof(Ap));
            for(k=s;k>=-s;k--)
            {
                A(k)=B(k-i*j)+B(k)+B(k+i*j);
                A(k)%=10000;
            }
        }
    printf("%d\n",A(x));
    return 0;
}