#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
int n, m, s;
void solve() {
  long long ans = 0;
  for (int h = 0; 2 * h + 1 <= n; h++) {
    for (int w = 0; 2 * w + 1 <= m; w++) {
      for (int th = 0; th <= h; th++) {
        if ((2 * h + 1) * (2 * w + 1) == s) {
          ans += 2LL * (w + 1) * (n - 2 * h) * (m - 2 * w);
          if (h == th) {
            ans -= (n - 2 * h) * (m - 2 * w);
          }
        } else {
          int g = (2 * h + 1) * (2 * w + 1) - s;
          if (g < 0) continue;
          if (h == th) {
            if (g == 0) {
              ans += 2 * (2LL * w + 1) * (n - 2 * h) * (m - 2 * w);
            }
          } else {
            int d = 4 * (h - th);
            if (g % d == 0) {
              g /= d;
              if (w < g) continue;
              int tw = w - g;
              ans += 2 * (n - 2 * h) * (m - 2 * w);
            }
          }
        }
      }
    }
  }
  cout << ans << endl;
}
int main() {
  while (cin >> n >> m >> s) {
    solve();
  }
}
