#include <bits/stdc++.h>
using namespace std;
int m, n, s;
long long ans = 0;
int main() {
  scanf("%d %d %d", &m, &n, &s);
  for (int a = 0; 2 * a < m; a++)
    for (int b = 0; 2 * b < n; b++)
      if ((2 * a + 1) * (2 * b + 1) == s)
        ans += (a + 1) * (b + 1) * (m - 2 * a) * (n - 2 * b);
  for (int c = 0; 2 * c < m; c++)
    for (int d = 0; 2 * d < n; d++)
      if ((2 * c + 1) * (2 * d + 1) == s)
        ans += c * d * (m - 2 * c) * (n - 2 * d);
  for (int a = 0; 2 * a < m; a++)
    for (int d = 0; 2 * d < n; d++)
      for (int b = 0; b < d; b++)
        if ((s - 2 * (a + d) - 1 - 4 * a * b) % (4 * (d - b)) == 0) {
          int c = (s - 2 * (a + d) - 1 - 4 * a * b) / (4 * (d - b));
          if (0 <= c && c <= a) ans += (m - 2 * a) * (n - 2 * d);
        }
  for (int c = 0; 2 * c < m; c++)
    for (int b = 0; 2 * b < n; b++)
      for (int a = 0; a < c; a++)
        if ((s - 2 * (b + c) - 1 - 4 * a * b) % (4 * (c - a)) == 0) {
          int d = (s - 2 * (b + c) - 1 - 4 * a * b) / (4 * (c - a));
          if (0 <= d && d <= b) ans += (m - 2 * c) * (n - 2 * b);
        }
  cout << ans << endl;
  return 0;
}
