#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int h, w, k; cin >> h >> w >> k;
  set<vector<int>> ans;
  const auto f = [&](auto&& f, int i, vector<int>& a) -> void {
    if (i == h * w) {
      REP(c, k) {
        if (count(ALL(a), c) == 0) return;
      }
      vector b(h, vector(w, -1));
      REP(i, h) REP(j, w) b[i][j] = a[i * w + j];
      set<vector<int>> eternal;
      REP(sy, h) REP(sx, w) {
        vector<int> c;
        REP(i, h) REP(j, w) c.emplace_back(b[(sy + i) % h][(sx + j) % w]);
        eternal.emplace(c);
      }
      ans.emplace(*eternal.begin());
      return;
    }
    REP(c, k) {
      a[i] = c;
      f(f, i + 1, a);
    }
  };
  vector<int> a(h * w, -1);
  f(f, 0, a);
  cout << ans.size() << '\n';
  return 0;
}