#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
const int mo = 1e9 + 7;
unsigned long long ans, f, n, m, h, k, s;
unsigned long long a[maxn], c[maxn];
unsigned long long b[maxn], flag;
int main() {
  int T;
  int cas = 1;
  while (cin >> n >> m >> s) {
    ans = 0;
    for (unsigned long long i = 1; i <= n; i += 2)
      for (unsigned long long j = 1; j <= m; j += 2) {
        if (i * j > s)
          break;
        else if (i * j == s) {
          ans += ((n - i / 2 * 2) * (m - j / 2 * 2)) *
                 ((i / 2 + 1) * (j / 2 + 1) * 2 - 1);
        } else {
          for (unsigned long long k = 1; k < i; k += 2)
            if ((s - i * j) % k == 0) {
              unsigned long long tmp = (s - i * j) / k + j;
              if (tmp <= m && (tmp & 1))
                ans += (n - i / 2 * 2) * (m - tmp / 2 * 2) * 2;
            }
        }
      }
    cout << ans << endl;
  }
  return 0;
}
