import sys

N,M,K = map(int,input().split())
P = 10 ** 9 + 7
if K < N:
    print(0)
    exit()
if K == 1:
    if M > 1:
        print(0)
        exit()
    else:
        print(1)
        exit()
        
C = K + 10
fact = [1] * C
fact_inv = [1] * C
for i in range(2,C):
    fact[i] = fact[i-1] * i % P
fact_inv[-1] = pow(fact[-1],P-2,P)
for i in range(C-2,0,-1):
    fact_inv[i] = fact_inv[i+1] * (i+1) % P
def comb(n,k):
    if n < 0 or k < 0 or k > n:return 0
    return fact[n] * fact_inv[k] * fact_inv[n-k] % P

def seki(x,y):
    l = [[0] * 2 for _ in range(2)]
    for i in range(2):
        for j in range(2):
            for k in range(2):
                l[i][j] = (l[i][j] + x[i][k] * y[k][j]) % P
    return l

def f(k):
    if N == 1:
        return k * pow(k-1,M-1,P) % P
    if N == 2:
        return k * (k-1) * pow(k*k-3*k+3,M-1,P)%P
    A = [[k * k - 3 * k + 3,k-1 + (k-2) * (k-3)],
         [2 * (k-2) * (k-2) + (k-2) * (k-3) * (k-3),2 * (k-2) * (k-2) + (k-3) * (k-3) * (k-3) + (k-2)*(k-3) + (k-3) * (k-3) * (k-4)]]
    for i in range(2):
        for j in range(2):
            A[i][j] %= P
    tmp = [[1,0],
           [0,1]]
    a = k * (k-1)
    b = k * (k-1) * (k-2)
    u = M-1
    while u:
        if u & 1:
            tmp = seki(tmp,A)
        A = seki(A,A)
        u >>= 1
    ans = (tmp[0][0] * a + tmp[0][1] * b + tmp[1][0] * a + tmp[1][1] * b) % P
    return ans

ans = 0
for i in range(K-1):
    if i % 2 == 0:
        c = 1
    else:
        c = -1
    tmp = comb(K,i) * f(K-i) * c
    ans = (ans + tmp) % P
print(ans)