#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
int n, m, s;
long long pos(long long a, long long b) { return (m - a + 1) * (n - b + 1); }
bool check(int a, int b, int c, int d, int x0, int y0) {
  if (x0 - a < 1 || x0 + a > m) return false;
  if (x0 - c < 1 || x0 + c > m) return false;
  if (y0 - b < 1 || y0 + b > n) return false;
  if (y0 - d < 1 || y0 + d > n) return false;
  int cnt = 0;
  for (int i = 1; i <= m; i++)
    for (int j = 1; j <= n; j++)
      if ((abs(i - x0) <= a && abs(j - y0) <= b) ||
          (abs(i - x0) <= c && abs(j - y0) <= d))
        ++cnt;
  return cnt == s;
}
int brute() {
  int res = 0;
  for (int a = 0; (((a) << 1) + 1) <= m; a++)
    for (int b = 0; (((b) << 1) + 1) <= n; b++)
      for (int c = 0; (((c) << 1) + 1) <= m; c++)
        for (int d = 0; (((d) << 1) + 1) <= n; d++)
          for (int x0 = 1; x0 <= m; x0++)
            for (int y0 = 1; y0 <= n; y0++)
              if (check(a, b, c, d, x0, y0)) ++res;
  return res;
}
int main() {
  while (scanf("%d%d%d", &n, &m, &s) == 3) {
    long long res = 0, now;
    for (int a = 0; (((a) << 1) + 1) <= m; a++)
      for (int b = 0; (((b) << 1) + 1) <= n; b++) {
        int s2 = s - (((a) << 1) + 1) * (((b) << 1) + 1);
        if (s2 < 0) continue;
        for (int c = a + 1; (((c) << 1) + 1) <= m; c++) {
          if (s2 % (2 * c - 2 * a) == 0) {
            int d = s2 / (2 * c - 2 * a);
            if (d % 2 == 0) continue;
            d = (d - 1) / 2;
            if (d >= b) continue;
            res += pos((((c) << 1) + 1), (((b) << 1) + 1));
          }
        }
      }
    for (int c = 1; (((c) << 1) + 1) <= m; c++)
      for (int d = 0; (((d) << 1) + 1) <= n; d++)
        if ((((c) << 1) + 1) * (((d) << 1) + 1) == s) {
          now = c * (d + 1LL);
          now *= pos((((c) << 1) + 1), (((d) << 1) + 1));
          res += now;
        }
    res *= 2;
    for (int c = 0; (((c) << 1) + 1) <= m; c++)
      for (int x = 0; (((x) << 1) + 1) <= n; x++)
        if ((((c) << 1) + 1) * (((x) << 1) + 1) == s) {
          now = 2 * x + 1;
          now *= pos((((c) << 1) + 1), (((x) << 1) + 1));
          res += now;
        }
    cout << res << endl;
  }
  return 0;
}
