#include <bits/stdc++.h>
using namespace std;
long long k, i, j, n, m, p, x, y, s, ans;
long long findd(long long n1, long long m1, long long s) {
  if (n1 * m1 == s) {
    return 2 * (n1 / 2 + 1) * (m1 / 2 + 1) - 1;
  } else if (n1 * m1 > s) {
    if ((n1 * m1 - s) % 4) return 0;
    long long v = 0;
    for (k = 1; 2 * k < n1; k++)
      if (((n1 * m1 - s) / 4) % k == 0) {
        p = ((n1 * m1 - s) / 4) / k;
        if (2 * p < m1 && p > 0) {
          int u = 1;
          if (i != 2 * k + 1 || j != p) u *= 2;
          v += u;
        }
      }
    return v;
  } else
    return 0;
}
int main() {
  cin >> n >> m >> s;
  for (i = 1; i <= n; i += 2)
    for (j = 1; j <= m; j += 2) {
      ans += findd(i, j, s) * (n - i + 1) * (m - j + 1);
    }
  cout << ans << endl;
}
