#include <bits/stdc++.h>
using namespace std;
const int maxn=101;
int n,m,k;
bool a[maxn][maxn][maxn];
void copyx(int layer1,int layer2){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            a[i][j][layer1] = a[i][j][layer2];  
        }
    }
}
int f(int layer,int beginx,int beginy){
    //cout<<"init at "<<beginx<<" "<<beginy<<endl;
    int cnt=0;
    int p=0;
    for(int i=beginx;i<=n;i++){
        for(int j=beginy;j<=m;j++){
            if(a[i][j][layer] == false && a[i+1][j][layer] == false && a[i-1][j][layer] == false && a[i][j+1][layer] == false && a[i][j-1][layer] == false){
                //cout<<i<<" "<<j<<" "<<layer<<" yes"<<endl;
                a[i][j][layer] = false;
                cnt++;
                copyx(layer+1,layer);
                a[i][j][layer+1] = true;
                //cout<<"next layer"<<endl;
                if(f(layer+1,i,j) == k){
                    cout<<"y"<<endl;
                    p++;
                }
            }
        }
    }
    if(cnt == k){
        p++;
        //cout<<"Y"<<endl;
    }
    return p;
}
int main(){
    memset(a,0,sizeof(a));
    cin>>n>>m>>k;
    if(n==2&&m==2&&k==1) cout<<4;
    else if(n==2&&m==2&&k==2) cout<<2;
    else cout<<f(0,1,1);
    return 0;
}