#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, s;
  long long ret = 0;
  scanf("%d%d%d", &n, &m, &s);
  for (int i = 1; i <= n; i += 2) {
    for (int j = 1; j <= m; j += 2) {
      if (i * j > s) continue;
      for (int u = 1; u <= n; u += 2) {
        if (u == min(i, u)) {
          if (s == i * j) {
            ret += (j + 1) / 2 * (n - max(i, u) + 1) * (m - j + 1);
          }
        } else {
          int v = (s - i * j) / (u - min(i, u));
          if (v <= j && v % 2 == 1 && i * j + u * v - min(i, u) * v == s) {
            ret += (n - max(i, u) + 1) * (m - j + 1);
          }
        }
        int v = (s - i * j + min(i, u) * j) / u;
        if (v <= m && v > j && v % 2 == 1 &&
            i * j + u * v - min(i, u) * j == s) {
          ret += (n - max(i, u) + 1) * (m - v + 1);
        }
      }
    }
  }
  cout << ret << endl;
  return 0;
}
