#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 17;
int n, m, k;
int a[N][N];
bool st[N][N];
LL ans;
void dfs(int u)
{
if (u == k + 1)
{
ans ++ ;
return ;
}
for (int i = 1; i <= n; i ++ )
{
for (int j = 1; j <= m; j ++ )
{
if (st[i - 1][j] == 0 && st[i][j - 1] == 0 && st[i + 1][j] == 0 && st[i][j + 1] == 0)
{
st[i][j] = 1;
dfs(u + 1);
st[i][j] = 0;
}
}
}
}
int main()
{
scanf("%d%d%d", &n, &m, &k);
dfs(1);
printf("%d\n", ans);
return 0;
}