h, w, k = map(int, input().split())
if k == 1:
    print(1)
    exit()

ans = 0
seen = set()
num = h * w
for bit in range(k**num):
    T = [[0 for _ in range(w)] for _ in range(h)]
    CNT = [0 for _ in range(k)]
    for i in range(h):
        for j in range(w):
            T[i][j] = bit % k
            CNT[bit % k] += 1
            bit //= k
    flag = True
    for i in range(k):
        if CNT[i] == 0:
            flag = False
            break
    if not flag:
        continue
    T = tuple([tuple([T[i][j] for j in range(w)]) for i in range(h)])
    for di in range(h):
        for dj in range(w):
            Tc = tuple([tuple([T[(i + di) % h][(j + dj) % w] for j in range(w)]) for i in range(h)])
            if Tc in seen:
                flag = False
                break
        if not flag:
            break
    if flag:
        ans += 1
        seen.add(T)
print(ans)