#include <stdio.h>
#include <iostream>

int n, m, k, a[50000], b[50000];

int abs(int x){	return x > 0 ? x : -x; }

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

	int i, j, l;
	scanf("%d %d %d",&n,&m,&k);

	if (abs(k) > 45000) {printf("0\n"); return 0;}

	a[0] = 1;
	for (i = 1; i <= n; i++)
		for (j = 1; j <= m; j++)
		{
			memcpy(b, a, sizeof(a));
			for (l = 0; l <= 45000; l++)
				a[l] = (b[abs(l - i * j)] + b[l] + b[l + i * j]) % 10000;
		}

	printf("%d\n", a[abs(k)]);
	return 0;
}