#include <bits/stdc++.h>
using namespace std;
long long ans = 0;
int n, m, s;
int cal(int a, int b, int c, int d) {
  return (n - 2 * max(a, c)) * (m - 2 * max(b, d));
}
int len(int a) { return a * 2 + 1; }
void check(int t, int p, int g, int a, int b, int c) {
  if (t > 0 && t % p == 0 && ((t / p) & 1)) {
    int d = ((t / p) - 1) >> 1;
    if (!g && b < d && len(d) <= m)
      ans += cal(a, b, c, d);
    else if (g && b > d)
      ans += cal(a, b, c, d);
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &s);
  for (int a = 0; a * 2 + 1 <= n; ++a) {
    for (int b = 0; b * 2 + 1 <= m; ++b) {
      for (int c = 0; c * 2 + 1 <= n; ++c) {
        if (a < c) {
          int t = s, p = len(c);
          check(t, p, 0, a, b, c);
          t = s - len(a) * len(b);
          p = len(c) - len(a);
          check(t, p, 1, a, b, c);
        } else {
          int t = s - len(a) * len(b) + len(c) * len(b), p = len(c);
          check(t, p, 0, a, b, c);
          if (len(a) * len(b) == s) ans += b * cal(a, b, c, 0);
        }
        if (len(a) * len(b) + len(c) * len(b) - min(len(a), len(c)) * len(b) ==
            s)
          ans += cal(a, b, c, b);
      }
    }
  }
  cout << ans << endl;
  return 0;
}
