#include <bits/stdc++.h>
using namespace std;
int n, m, s;
long long cal(int a, int b, int c, int d) {}
int main() {
  while (cin >> n >> m >> s) {
    long long cnt = 0;
    for (int a = 1; a <= n; a += 2)
      for (int b = 1; b <= m; b += 2) {
        if (a * b > s) break;
        for (int c = 1; c <= n; c += 2) {
          if (c <= a) {
            int d = s - a * b;
            if (d % (2 * c)) continue;
            d = d / c + b;
            if (d > m) continue;
            if (d > b)
              cnt += 1ll * (m - d + 1) * (n - a + 1);
            else
              cnt += 1ll * (b + 1) / 2 * (m - b + 1) * (n - a + 1);
          } else {
            if (s % c == 0 && s / c >= b && ((s / c) & 1) && s / c <= m) {
              cnt += 1ll * (n - c + 1) * (m - s / c + 1);
            }
            int d = s - a * b;
            if (d % (c - a)) continue;
            d /= c - a;
            if (~d & 1) continue;
            if (d >= b) continue;
            cnt += 1ll * (n - c + 1) * (m - b + 1);
          }
        }
      }
    cout << cnt << endl;
  }
}
