#include <bits/stdc++.h>
using namespace std;

const int N = 90005;
const int MAGIC = N / 2;
const int MOD = 1e4;

int i, j, n, m, sum, a[405], nr, row; 
long long need;
short dp[405][N];

int DP(int poz, int val) {
  if(val < 0 || val >= N) return 0;
  if(dp[poz][val] != -1) return dp[poz][val];
  if(poz < 1) return 0;

  dp[poz][val] += DP(poz - 1, val - a[poz]);
  if(dp[poz][val] >= MOD) dp[poz][val] -= MOD;
  dp[poz][val] += DP(poz - 1, val);
  if(dp[poz][val] >= MOD) dp[poz][val] -= MOD;
  dp[poz][val] += DP(poz - 1, val + a[poz]);
  if(dp[poz][val] >= MOD) dp[poz][val] -= MOD;

  return dp[poz][val];
}

int main() {
  ifstream cin("diamant.in");
  ofstream cout("diamant.out");
  ios_base::sync_with_stdio(0);

  cin >> n >> m >> need;

  for(i = 1; i <= n; ++i)
    for(j = 1; j <= m; ++j)
      a[++nr] = i * j, sum += a[nr];

  if(need > sum || need < -sum) return cout << "0\n", 0;

  for(i = 1; i <= nr; ++i)
    for(j = 0; j < N; ++j)
      dp[i][j] = -1;

  dp[0][MAGIC] = 1;

  cout << DP(nr, MAGIC + need) << '\n';

  return 0;
}