#include <bits/stdc++.h>
using namespace std;
int n, m, s;
long long ans;
int count(int a, int b, int c, int d) {
  int a1 = 2 * max(a, c) + 1;
  int b1 = 2 * max(b, d) + 1;
  if ((n - a1 + 1) <= 0 || (m - b1 + 1) <= 0) return 0;
  return 1ll * (n - a1 + 1) * (m - b1 + 1);
}
int find(int a, int b, int c) {
  long long res = 0;
  int S = s - (2 * a + 1) * (2 * b + 1) + (2 * min(a, c) + 1) * (2 * b + 1);
  if (S <= 0) return res;
  if (S % (2 * c + 1) == 0 && S / (2 * c + 1) % 2 == 1) {
    int d = (S / (2 * c + 1)) / 2;
    if (d > b) {
      res += count(a, b, c, d);
    }
  }
  S = s - (2 * a + 1) * (2 * b + 1);
  if (min(a, c) == c) {
    if (S == 0) {
      res += (1ll * count(a, b, c, 0) * (b + 1));
    }
  } else {
    if (S <= 0) return res;
    if (S % ((2 * c + 1) - (2 * a + 1)) == 0 &&
        (S / ((2 * c + 1) - (2 * a + 1))) % 2 == 1) {
      int d = (S / ((2 * c + 1) - (2 * a + 1))) / 2;
      if (d <= b) {
        res += count(a, b, c, d);
      }
    }
  }
  return res;
}
int main() {
  cin >> n >> m >> s;
  for (int a = 0; a <= n; a++) {
    for (int b = 0; b <= m; b++) {
      for (int c = 0; c <= n; c++) {
        ans += find(a, b, c);
      }
    }
  }
  cout << ans << endl;
  return 0;
}
