#include <bits/stdc++.h>
using namespace std;
int N, M, S;
int main() {
  scanf("%d%d%d", &N, &M, &S);
  long long ans = 0;
  for (int i = 0; i <= (N - 1) / 2 && (i * 2 + 1) <= S; ++i)
    for (int j = 0; j <= (M - 1) / 2 && (i * 2 + 1) * (j * 2 + 1) <= S; ++j) {
      long long s = S - (i * 2 + 1) * (j * 2 + 1);
      if (s == 0) {
        ans += (i + 1) * (j + 1) * (N - i * 2) * (M - j * 2) * 2 -
               (N - i * 2) * (M - j * 2);
        continue;
      }
      for (int k = 0; k < i; ++k) {
        long long len = k * 2 + 1;
        long long ex = s / len / 2;
        if ((j + ex) * 2 + 1 <= M && ex * 2 * len == s)
          ans += (N - i * 2) * (M - (j + ex) * 2) * 2;
      }
    }
  printf("%lld\n", ans);
  return 0;
}
