#include <bits/stdc++.h>
using namespace std;
inline int solve(int w, int h, int S) {
  if (S == (2 * w + 1) * (2 * h + 1)) return 2 * (w + 1) * (h + 1) - 1;
  if (S > (2 * w + 1) * (2 * h + 1)) return 0;
  S = (2 * w + 1) * (2 * h + 1) - S;
  if (S & 3) return 0;
  S /= 4;
  int res = 0;
  for (int w2 = 0; w2 < w; w2++) {
    if (S % (w - w2)) continue;
    int h2 = h - S / (w - w2);
    if (h2 < 0 || h2 >= h) continue;
    res++;
  }
  return 2 * res;
}
int main() {
  int W, H, s;
  while (scanf("%d%d%d", &W, &H, &s) >= 1) {
    long long ans = 0;
    for (int w = 0; 2 * w + 1 <= W; w++) {
      for (int h = 0; 2 * h + 1 <= H; h++) {
        ans += solve(w, h, s) * (long long)(W - (2 * w + 1) + 1) *
               (H - (2 * h + 1) + 1);
      }
    }
    printf(
        "%lld"
        "\n",
        ans);
  }
  return 0;
}
