import sys
#input = sys.stdin.readline #文字列につけてはダメ
#input = sys.stdin.buffer.readline #文字列につけてはダメ
#sys.setrecursionlimit(1000000)
#import bisect
import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]

def check(x,k):
    s = set([])
    for v in x:
        s.add(v)
    if len(s) == k:
        return True
    return False

def main():
    H,W,K = map(int,input().split())
    N = H*W
    base = [i for i in range(K)]
    L = itertools.product(base,repeat=N)
    S = set([])
    ans = 0
    for X in L:
        if not check(X,K): continue
        TX = tuple(X)
        if TX in S: continue
        #print(TX)
        ans += 1
        NX = [-1]*N
        for di in range(H):
            for dj in range(W):
                for i in range(H):
                    for j in range(W):
                        idx = i * W + j
                        ni = (i + di) % H
                        nj = (j + dj) % W
                        nidx = ni * W + nj
                        NX[nidx] = X[idx]
                TNX = tuple(NX)
                #print("T",TNX)
                S.add(TNX)
    print(ans)          
    
if __name__ == '__main__':
    main()