#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll mod=1000000007;
ld inf=10000999999999900;
int main(){
    ll h,w,k;
    cin >> h >> w >> k;
    if (k==1)
    {
        cout << 1 << endl;
        return 0;
    }
    vector<ll>thr(30,1);
    for (ll i = 1; i < 20; i++)
    {
        thr[i]=thr[i-1]*k;
    }
    map<vector<vector<ll>>,ll>memo;
    for (ll i = 0; i < thr[h*w]; i++)
    {
        vector<vector<ll>>g(h,vector<ll>(w));
        vector<ll>mm(k,0);
        for (ll j = 0; j < h; j++)
        {
            for (ll k = 0; k < w; k++)
            {
                ll y=j*w+k;
                ll x=(i%thr[y+1])/thr[y];
                g[j][k]=x;
                mm[x]=1;
            }
        }
        bool o=true;
        for (ll j = 0; j < k; j++)
        {
            if (mm[j]==0)
            {
                o=false;
                break;
            }
        }
        if (!o)
        {
            continue;
        }
        bool ok=true;
        for (ll j = 0; j < h; j++)
        {
            for (ll k = 0; k < w; k++)
            {
                vector<vector<ll>>gg(h,vector<ll>(w));
                for (ll l = 0; l < h; l++)
                {
                    for (ll m = 0; m < w; m++)
                    {
                        gg[(j+l)%h][(k+m)%w]=g[l][m];
                    }
                }
                if (memo[gg]!=0)
                {
                    ok=false;
                    break;
                }
            }
            if (!ok)
            {
                break;
            }
            
        }
        if (ok)
        {
            memo[g]=1;
        }
    }
    ll ans=0;
    for(auto v:memo){
        ans+=v.second;
    }
    cout << ans << endl;
}