#include <bits/stdc++.h>
using namespace std;
long long ans = 0;
int main() {
  int n, m, i, j, k, l, s;
  scanf("%d%d%d", &n, &m, &s);
  for (i = 1; i <= n; i += 2)
    for (j = 1; j <= m; j += 2)
      if (s == i * j) {
        ans += (((long long)n - i + 1) * (m - j + 1)) * ((long long)i / 2 + 1) *
               (j / 2 + 1) * 2;
        ans -= (n - i + 1) * (m - j + 1);
      }
  for (i = 1; i <= n; i += 2)
    for (j = 1; j <= m; j += 2) {
      int ss = s + i * j;
      for (k = i + 2; k <= n && ss > j * k; k += 2) {
        if ((ss - j * k) % i == 0) {
          l = (ss - j * k) / i;
          if (l <= j || !(l & 1) || l > m)
            ;
          else {
            ans += (n - k + 1) * (m - l + 1) * 2;
          }
        }
      }
    }
  cout << ans << endl;
  return 0;
}
