#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <iomanip>
#include <utility>
#include <tuple>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <cassert>
#include <functional>
#include <numeric>
#include <type_traits>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define coutf(f) cout << fixed << setprecision(f)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
const int inf = 1e9;
const ll INF = 1e18;
const int mod = 998244353;
using Graph = vector<vector<int>>;

int main() {
	ll h, w, k;
	cin >> h >> w >> k;
	int c = 1;
	rep(i, h * w) c *= k;
	vector<int> f(c, 0);
	int r = 0;
	rep(u, c) {
		int p[10][10], q[3] = {};
		int t = u;
		rep(i, h) {
			rep(j, w) {
				p[i][j] = t % k;
				t /= k;
				q[p[i][j]] = 1;
			}
		}
		int s = 0;
		rep(i, k) s += q[i];
		if (s != k) continue;
		int g = 0;
		rep(x, h) rep(y, w) {
			int t = 0, s = 1;
			rep(i, h) rep(j, w) {
				t += p[(i + x) % h][(j + y) % w] * s;
				s *= k;
			}
			g |= f[t];
		}
		if (g == 0) f[u] = 1, r++;
	}
	cout << r << endl;
	return 0;
}