# A*B
def mat_mul(A, B, mod):
    C = [[0]*len(B[0]) for i in range(len(A))]
    for i in range(len(A)):
        for k in range(len(B)):
            for j in range(len(B[0])):
                C[i][j] = (C[i][j] + A[i][k]*B[k][j])%mod
    return C

#A**n
def mat_pow(A, n, mod):
    B = [[0]*len(A) for i in range(len(A))]
    for i in range(len(A)):
        B[i][i] = 1
    while n > 0:
        if n & 1 == 1:
            B = mat_mul(A, B, mod)
        A = mat_mul(A, A, mod)
        n = n>>1
    return B

c, n, m = map(int, input().split())

mod = 10**9+7
p = pow(c, mod-2, mod)
A = [[p,0,0,p],[0,p,1-p,1-2*p],[1,0,0,0],[0,1,0,0]]
X = [p, 0, 1, 0]
M = mat_pow(A, n-1, mod)
a = 0
for j in range(4):
    a += M[0][j]*X[j]
    a %= mod
ans = 1-pow(1-a, m, mod)
print(ans%mod)