#include <bits/stdc++.h>
using namespace std;
long long n, m, s;
int main() {
  scanf("%I64d%I64d%I64d", &n, &m, &s);
  long long ans = 0;
  for (int i = 0; i <= (n - 1) / 2; i++)
    for (int j = 0; j <= (n - 1) / 2; j++)
      for (int k = 0; k <= (m - 1) / 2; k++) {
        long long st, a1, b1, a2, b2;
        a1 = i + i + 1;
        b1 = k + k + 1;
        a2 = j + j + 1;
        st = s - a1 * b1;
        if (a1 == 5 && b1 == 5 && a2 == 1) printf("\n");
        int tmp = 1;
        if (st < 0) continue;
        bool cd = true;
        if (a2 <= a1) {
          if (st % a2 == 0) {
            b2 = b1 + st / a2;
            if (st == 0) tmp = (b1 + 1) / 2;
          } else
            cd = false;
        } else {
          if (st <= b1 * (a2 - a1)) {
            if (st % (a2 - a1) == 0)
              b2 = st / (a2 - a1);
            else
              cd = false;
          } else {
            st -= b1 * (a2 - a1);
            if (st % a2 == 0)
              b2 = st / a2 + b1;
            else
              cd = false;
          }
        }
        if (cd && b2 <= m && b2 > 0 && (b2 & 1)) {
          long long tans = (n + 1 - max(a1, a2)) * (m + 1 - max(b1, b2));
          tans *= tmp;
          ans += tans;
        }
      }
  printf("%I64d\n", ans);
  return 0;
}
