/* -*- coding: utf-8 -*-
 *
 * 1797.cc:  No.1797 永遠のグリッド - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 10;
const int NBITS = 59049; // = 3^10
const int MAX_K = 3;

/* typedef */

typedef int vec[MAX_N];

/* global variables */

bool used[NBITS];
vec va, vb;
int cs[MAX_K];

/* subroutines */

inline int yx2p(int y, int x, int w) { return y * w + x; }

inline void p2yx(int p, int &y, int &x, int w) { y = p / w, x = p % w; }

int v2bits(int k, int n, vec v) {
  int bits = 0;
  for (int i = n - 1; i >= 0; i--) bits = bits * k + v[i];
  return bits;
}

void bits2v(int bits, int k, int n, vec v) {
  for (int i = 0; i < n; i++, bits /= k) v[i] = bits % k;
}

inline int cnum(int k, int n, vec v) {
  fill(cs, cs + k, 0);
  for (int i = 0; i < n; i++) cs[v[i]]++;

  int cn = 0;
  for (int i = 0; i < k; i++)
    if (cs[i]) cn++;
  return cn;
}

/* main */

int main() {
  int h, w, k;
  scanf("%d%d%d", &h, &w, &k);
  int n = h * w;

  int nbits = 1;
  for (int i = 0; i < n; i++) nbits *= k;

  int c = 0;
  for (int bits = 0; bits < nbits; bits++)
    if (! used[bits]) {
      bits2v(bits, k, n, va);
      if (cnum(k, n, va) != k) continue;

      c++;
      for (int dy = 0; dy < h; dy++)
	for (int dx = 0; dx < w; dx++) {
	  for (int y = 0, p0 = 0; y < h; y++)
	    for (int x = 0; x < w; x++, p0++) {
	      int p1 = yx2p((y + dy) % h, (x + dx) % w, w);
	      vb[p1] = va[p0];
	    }
	  used[v2bits(k, n, vb)] = true;
	}
    }

  printf("%d\n", c);
  return 0;
}