#include <cstdio>
#include <cstdlib>
#include <cmath>
using namespace std;

const int NMAX = 21, SMAX = 50010, MOD = 10000;

int N, M, X, Ways[2][SMAX], C = 1, P;

int main()
{
    freopen("diamant.in", "r", stdin);
    freopen("diamant.out", "w", stdout);

    scanf("%i %i %i", &N, &M, &X);

    Ways[0][0] = 1;
    for(int i = 1; i <= N; ++ i)
        for(int j = 1; j <= M; ++ j)
        {
            for(int k = 0; k < SMAX; ++ k)
                Ways[C][k] = (Ways[P][abs(k - i * j)] + Ways[P][k] + Ways[P][k + i * j]) % MOD;
            P ^= 1;
            C ^= 1;
        }

    if(abs(X) > SMAX) printf("0\n");
    else printf("%i\n", Ways[P][abs(X)]);
}