#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <fstream>
#include <sstream>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <random>
#include <climits>

using namespace std;

ifstream fin("diamant.in");
ofstream fout("diamant.out");

const vector<int> elements = {-1, 0, 1};
int n, m, x;
int ans = 0;

void backtracking(vector<int> &selectedItems) {
    if (selectedItems.size() == n * m) {
        int index = 0;
        int mat[n + 1][m + 1];

        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                mat[i][j] = selectedItems[index];
                ++index;
            }
        }

        int sum = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (mat[i][j] == 1) {
                    sum += ((i + 1) * (j + 1));
                } else if (mat[i][j] == -1) {
                    sum -= ((i + 1) * (j + 1));
                }
            }
        }
        if (sum == x) {
            ++ans;
        }
        return;
    }
    for (int i = 0; i < elements.size(); ++i) {
        selectedItems.push_back(elements[i]);
        backtracking(selectedItems);
        selectedItems.pop_back();
    }
}

int main() {
    fin >> n >> m >> x;
    vector<int> selectedItems;

    backtracking(selectedItems);

    fout << ans;

    return 0;
}