from copy import deepcopy
MOD = 10 ** 9 + 7

def matpow(A, B, w):
    l = len(A)
    while w:
        if w & 1:
            C = [0] * l
            for i in range(l):
                for j in range(l):
                    C[i] += A[i][j] * B[j]
                    C[i] %= MOD
            B = C.copy()
        C = [[0] * l for _ in range(l)]
        for i in range(l):
            for j in range(l):
                for k in range(l):
                    C[i][j] += A[i][k] * A[k][j]
                    C[i][j] %= MOD
        A = deepcopy(C)
        w >>= 1
    return B

m, n, c = map(int, input().split())
inv = pow(m, MOD - 2, MOD) % MOD
# A_i, A_{i-1}, B_i, B_{i-1}
B = [inv, 1, 0, 0]
A = [[inv, 0, 0, inv],
     [1, 0, 0, 0],
     [0, (m - 1) * inv, inv, (m - 2) * inv],
     [0, 0, 1, 0]]
n -= 1

B = matpow(A, B, n)
ans = 1 - B[0]
ans = pow(ans, c, MOD)
print((1 - ans) % MOD)