#include<cstdio>

#define XMAX 60000+20

int i,j,n,m,x,k,An[2][XMAX],Ap[2][XMAX],s;
bool p;

inline int A(int p,int i)
{
	return (((i)<0)?(An[(p)][-(i)]):(Ap[(p)][(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;}
    Ap[0][0]=1;
    for(i=1,p=1;i<=n;i++)
        for(j=1;j<=m;j++,p=!p)
        {
            for(k=s;k>=-s;k--)
            {
                if(k<0) An[p][-k]=(A(!p,k-i*j)+A(!p,k)+A(!p,k+i*j))%10000;
                else Ap[p][k]=(A(!p,k-i*j)+A(!p,k)+A(!p,k+i*j))%10000;
            }
        }
    printf("%d\n",A(!p,x));
    return 0;
}