#include <bits/stdc++.h>
using namespace std;
int n, m, s;
long long res;
int main() {
  cin >> n >> m >> s;
  if (s % 2 == 0) {
    cout << 0 << endl;
    return 0;
  }
  for (int a = 0; a < (n - 1) / 2 + 1; a++) {
    for (int b = 0; b < (m - 1) / 2 + 1; b++) {
      int sq = (a * 2 + 1) * (b * 2 + 1);
      if (sq > s) continue;
      if (sq == s) {
        res += (n - 2 * a) * (m - 2 * b) * ((a + 1) * (b + 1) * 2 - 1);
      } else {
        sq = s - sq;
        if (sq % 2) continue;
        sq /= 2;
        for (int c = 0; c < a; c++) {
          if (sq % (2 * c + 1) != 0) continue;
          int d = sq / (2 * c + 1);
          if ((d + b) * 2 + 1 > m) continue;
          res += (n - 2 * a) * (m - (b + d) * 2) * 2;
        }
      }
    }
  }
  cout << res << endl;
}
