#pragma once

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

using namespace std;

#define L 21
#define C 21
#define MM 3*49100

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

int dp[2][MM];  // dp[i][j] nr moduri in care din primele i elem obtii greutatea j
int N, M, X;

void bu(int n, int m, int x, int maxAbs) {
	int k = 0;
	dp[0][maxAbs] = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			k++;
			for (int g = 0; g <= 2*maxAbs; g++) {
				dp[k%2][g] = (dp[(k - 1)%2][g] + dp[(k - 1)%2][g - i * j] + dp[(k - 1)%2][g + i * j]) % 10000;
			}
		}
	}
	fout << dp[k%2][x+maxAbs];
}

int main() {
	fin >> N >> M >> X;
	int maxAbs = N * (N + 1)*M*(M + 1) / 4;
	if (X<-maxAbs || X>maxAbs)
		fout << 0;
	else
		bu(N, M, X, maxAbs);
	return 0;

}