#include      <iostream>
#include      <fstream>
#include      <algorithm>

using namespace std;

ifstream in("diamant.in");
ofstream out("diamant.out");

const short mod = 10000;

short n, m, dp[90005][2];
int x, sum;

int main() {
	ios_base::sync_with_stdio(false);
	in.tie(NULL), out.tie(NULL);

	in >> n >> m >> x;

	x = abs(x);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			sum += i * j;
		}
	}

	if (x > sum) {
		out << 0;
		return 0;
	}
	dp[sum][1] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			for (int d = 0; d <= 2 * sum; d++) {
				dp[d][0] = dp[d][1];
			}
			for (int d = 0; d <= 2 * sum; d++) {
				if (i * j + d <= 2 * sum) {
					dp[d][1] += dp[d + i * j][0];
				}
				if (d - i * j >= 0) {
					dp[d][1] += dp[d - i * j][0];
				}
				dp[d][1] %= mod;
			}
		}
	}

	out << dp[x + sum][1];

	return 0;
}