#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, m, s, ofoghi, amudi, x, y;
  while (cin >> n >> m >> s) {
    long long count = 0;
    for (int i = 1; i <= n; i += 2) {
      for (int j = 1; j <= m; j += 2) {
        if (i * j == s)
          count +=
              (n - i + 1) * (m - j + 1) * (2 * (i / 2 + 1) * (j / 2 + 1) - 1);
        else if (i * j > s && (i * j - s) % 4 == 0)
          for (int x = 1; 2 * x < i; x++)
            for (int y = 1; 2 * y < j; y++)
              if (x * y * 4 + s == i * j)
                count += (2 * (n - i + 1) * (m - j + 1));
      }
    }
    cout << count << endl;
  }
  return 0;
}
