#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define reps(i,n) for(int i=1;i<=(n);++i)
#define repr(i,n) for(int i=2;i*i<=(n);++i)
#define ll long long
#define all(x) (x).begin(),(x).end()
#define sz(x) ((string)(x).size())
#define pb push_back
#define pob pop_back()
#define MMod (ll)1000000007
#define mmod (ll)998244353
#define setp(x) setprecision((ll)(x))
#define INF (ll)(1000000000000000000)
using namespace std;
using vi=vector<int>;
using vc=vector<char>;
using vb=vector<bool>;
using vl=vector<long long>;
using vvi=vector<vi>;
using vvl=vector<vl>;
using vvc=vector<vc>;
using vvb=vector<vb>;
using vpi=vector<pair<int,int>>;
using vpl=vector<pair<ll,ll>>;
using vs=vector<string>;
using pii=pair<int, int>;
using pll=pair<ll,ll>;
using pqi=priority_queue<int>;

int main(){
  int h,w,K; cin>>h>>w>>K;
  int x=h*w,c=0;
  vi q(x,1);
  reps(i,x-1) q[i]*=q[i-1]*K;
  reverse(all(q));
  int kk=1;
  vvi r(h,vi(w)),p(h,vi(w));
  rep(i,x-1) kk*=K;
  map<vvi,int> a;
  rep(i,kk){
    vi aa(K,0);
    int m=i;
    rep(j,x){
      p[j/w][j%w]=m/q[j];
      aa[m/q[j]]=1;
      m%=q[j];
    }
    int d=0;
    rep(j,3) d+=aa[j];
    if(d<K) continue;
    int b=1,bb=1;
    rep(j,h){
      rep(k,w){
        rep(s,h)rep(t,w) r[s][t]=p[(j+s)%h][(k+t)%w];
        if(a[r]==1){
          b=0;
          break;
        }
      }
      if(b==0){
        bb=0;
        break;
      }
    }
    if(bb){ 
      c++;
      a[p]=1;
    }
  }
  cout<<c<<endl;
  return 0;
}