//HighFlow
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <fstream>
#include <string.h>
#include <math.h>
#include <algorithm>
#define fcat(c) while (c!='\n') fscanf(f,"%c",&c)
#define cat(c) while (c!='\n') scanf("%c",&c)
#define For(i,st,dr,k) for (int i=(st);i<=(dr);i+=(k))
#define ll (long long)
#define kfl(i,j) (a[(i)][(j)].c-a[(i)][(j)].f)
#define md 10000
using namespace std;
FILE *f,*g;
int i,j,s,n,m,x,k,cn,q;
int d[410];
int C[500][500];
int din[100100],din2[100100];
#define din (din+50000)
#define din2 (din2+50000)
int mx,mx2,mn,mn2;

void pre()
{
    int i,j;
    for (i=0;i<=450;i++)  C[i][0]=C[i][i]=1;
    for (i=1;i<=450;i++)
        for (j=1;j<i;j++)
            C[i][j]=(C[i-1][j]+C[i-1][j-1])%md;
}


int main()
{
    f=fopen("diamant.in","r");
    g=fopen("diamant.out","w");

    fscanf(f,"%d%d%d",&n,&m,&x);
    pre();

    for (i=1;i<=n;i++)
        for (j=1;j<=m;j++)
        {
            s+=i*j;
            d[i*j]++;
        }
    if (x>s || x<-s)
    {
        fprintf(g,"0");
        return 0;
    }

    mx=0;
    din[0]=1;

    for (i=1;i<=n*m;i++)
        if (d[i]!=0)
        {
            for (j=0;j<=d[i];j++)
                for (k=0;k<=d[i]-j;k++)
                {
                    cn=i*(j-k);
                    for (q=mn;q<=mx;q++)
                    {
                        din2[q+cn]+=din[q]*C[d[i]][j]*C[d[i]-j][k];
                       // din2[q+cn]=din2[q+cn]%md;
                    }
                    mx2=max(max(mx+cn,mx-cn),mx2);
                    mn2=min(min(mn+cn,mn-cn),mn2);
                }
            mx=mx2;
            mn=mn2;
            for (j=mn;j<=mx;j++)
            {
                din[j]=din2[j]%md;
                din2[j]=0;
            }
        }

    fprintf(g,"%d",din[x]);

	return 0;
}