#include <bits/stdc++.h>
using namespace std;
long long n, m, mas, res = 0;
long long cnt(int a, int b, int c, int d) {
  int A = n - 2 * max(a, c), B = m - 2 * max(b, d);
  if (A <= 0 || B <= 0) return 0;
  return A * B;
}
void solve(int a, int b, int c) {
  long long s = mas - 1ll * (2 * a + 1) * (2 * b + 1);
  if (s < 0ll) return;
  long long sp = s + 1ll * ((2 * min(a, c) + 1) * (2 * b + 1));
  if (sp % (2 * c + 1) == 0 && (sp / (2 * c + 1)) % 2 == 1) {
    long long d = (sp / (2 * c + 1)) / 2;
    if (b < d && d <= (m + 1) / 2) res += 1ll * cnt(a, b, c, d);
  }
  sp = (2 * c + 1 - (2 * min(a, c) + 1));
  if (sp == 0) {
    if (s == 0) res += 1ll * (cnt(a, b, c, 0) * (b + 1));
  } else if (s % sp == 0 && (s / sp) % 2 == 1) {
    int d = (s / sp) / 2;
    if (b >= d) res += cnt(a, b, c, d);
  }
}
int main() {
  cin >> n >> m >> mas;
  for (int a = 0; a <= min(n, n / 2 + 2); a++)
    for (int b = 0; b < min(m, m / 2 + 2); b++)
      for (int c = 0; c < min(n, n / 2 + 2); c++) solve(a, b, c);
  cout << res;
}
