#include <bits/stdc++.h>
using namespace std;
int N, M, S;
int main() {
  cin >> N >> M >> S;
  long long ret = 0;
  for (int a = 0; 2 * a + 1 <= N; a++) {
    for (int b = 0; 2 * b + 1 <= M; b++) {
      int A1 = (2 * a + 1) * (2 * b + 1);
      if (A1 > S) continue;
      int L = S - A1;
      for (int c = 0; c <= a; c++) {
        if (L % (2 * c + 1) == 0) {
          int L2 = L / (2 * c + 1);
          if (L2 % 2) continue;
          int L3 = L2 / 2;
          if (L3 == 0) {
            if (2 * a + 1 <= N && 2 * b + 1 <= M) {
              ret += (b + 1LL) * (N - 2 * a) * (M - 2 * b);
            }
          } else {
            int d = L3 + b;
            if (2 * a + 1 <= N && 2 * d + 1 <= M) {
              ret += (N - 2 * a) * (M - 2 * d);
            }
          }
        }
      }
      for (int c = a + 1; 2 * c + 1 <= N; c++) {
        {
          if (L % (2 * c - 2 * a) == 0) {
            int L2 = L / (2 * c - 2 * a);
            if (L2 % 2 != 0) {
              int d = L2 / 2;
              if (d <= b && 2 * b + 1 <= M && 2 * c + 1 <= N) {
                ret += (N - 2 * c) * (M - 2 * b);
              }
            }
          }
        }
        {
          int A0 = (2 * a + 1) * (2 * b + 1);
          int A2 = L + A0;
          if (A2 % (2 * c + 1) == 0) {
            int L5 = A2 / (2 * c + 1);
            if (L5 % 2 != 0) {
              int d = L5 / 2;
              if (d > b && 2 * d + 1 <= M && 2 * c + 1 <= N) {
                ret += (N - 2 * c) * (M - 2 * d);
              }
            }
          }
        }
      }
    }
  }
  cout << ret << "\n";
}
