#include <iostream>
#include <vector>
#include <set>
#include <tuple>
#include <algorithm>
using namespace std;
bool f(const vector<pair<int, int>>& p, int n, int m) {
    vector<pair<int, int>> directions = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
    set<pair<int, int>> ps(p.begin(), p.end());

    for (const auto& pos : p) {
        int x = pos.first, y = pos.second;
        for (const auto& dir : directions) {
            int nx = x + dir.first;
            int ny = y + dir.second;
            if (ps.count({nx, ny})) {
                return false;  
            }
        }
    }
    return true;  
}


int main() {
    int n, m, k;
    cin >> n >> m >> k;
    if (k == 0) {
        return 1; 
    }
    vector<pair<int, int>> cells;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cells.emplace_back(i, j);
        }
    }

    int valid_count = 0;
    vector<bool> select(cells.size(), false);
    fill(select.begin(), select.begin() + k, true);  

    do {
        vector<pair<int, int>> a;
        for (int i = 0; i < cells.size(); ++i) {
            if (select[i]) {
                a.push_back(cells[i]);
            }
        }
        if (f(a, n, m)) {
            valid_count++;
        }
    } while (prev_permutation(select.begin(), select.end()));
    cout << valid_count<< endl;

    return 0;
}