H, W, K = map(int, input().split())

st = set()
for b in range(K ** (H * W)):
    ct = set((b // (K ** i)) % K for i in range(H * W))
    if len(ct) != K:
        continue

    bh = b
    flag = False
    for h in range(H):
        bw = bh
        for w in range(W):
            # print(h, w, bw)
            # print(np.array([(bw // (K ** i)) % K for i in range(H * W)]).reshape((H, W)))
            if bw in st:
                flag = True
                break

            bw *= K
            for h2 in range(H):
                m = (bw // (K ** ((h2 + 1) * W))) % K
                bw += m * (K ** (h2 * W) - K ** ((h2 + 1) * W))

        if flag:
            break
        bh *= (K ** W)
        for w2 in range(W):
            m = (bh // (K ** (H * W + w2))) % K
            bh += m * (K ** w2 - K ** (H * W + w2))

    else:
        st.add(b)

print(len(st))