#include <cstdio>
using namespace std;

#define MAXV 45000
#define MOD 10000

const int Nmax = 1<<17;
const int Vmax = 45000;
const int Mod = 10000;

int N, M, X;
int A[Nmax], B[Nmax], Sum;

#define A (A+MAXV)
#define B (B+MAXV)
#define rest(x,y) ((x)-(x)/(y)*(y))

int Solve()
{
    int c = 0;

    A[0] = 1;
    for (int i=1;i<=N;++i)
        for (int j=1;j<=M;++j)
        {
            if (c % 2 == 0)
                for (int val=-Sum;val<=Sum;++val)
                {
                    B[val] = A[val]+A[val-i*j]+A[val+i*j];
                    B[val] = rest(B[val], MOD);
                }
            else
                for (int val=-Sum;val<=Sum;++val)
                {
                    A[val] = B[val]+B[val-i*j]+B[val+i*j];
                    A[val] = rest(A[val], MOD);
                }
            c++;
        }
    if ( c % 2 == 0 )
        return A[X];
    else
        return B[X];
}

int main(void)
{
    freopen("diamant.in", "rt", stdin);
    freopen("diamant.out", "wt", stdout);

    scanf("%d %d %d\n", &N, &M, &X);

    Sum = N*(N+1)*M*(M+1)/4;

    if ( ( X > Sum ) || ( -X > Sum ) )
        printf("0\n");
    else
        printf("%d\n", Solve() );

    return 0;
}