mod=10**9+7

# 行列の計算（numpyを使えないとき,modを使用）
def prod(A,B,k,l,m):# A:k*l,B:l*m
    C=[[None for i in range(m)] for j in range(k)]

    for i in range(k):
        for j in range(m):
            ANS=0
            for pl in range(l):
                ANS=(ANS+A[i][pl]*B[pl][j])%mod

            C[i][j]=ANS

    return C

def plus(A,B,k,l):# a,B:k*l
    C=[[None for i in range(l)] for j in range(k)]

    for i in range(k):
        for j in range(l):
            C[i][j]=(A[i][j]+B[i][j])%mod

    return C

C,n,M=map(int,input().split())

INV=pow(C,mod-2,mod)

A=[[0]*(C*2) for i in range(2*C)]

for i in range(C):
    A[i][i]=INV
    for j in range(C,2*C):
        if i+C!=j:
            A[i][j]=INV

for i in range(C):
    A[i+C][i]=1

POWA=[A]
for i in range(60):
    POWA.append(prod(POWA[-1],POWA[-1],2*C,2*C,2*C)) # ベキを求めて


X=[[0]*(C*2)]
X[0][0]=1

while n:
    X=prod(X,POWA[n.bit_length()-1],1,2*C,2*C) # n乗の場合
    n-=1<<(n.bit_length()-1)

#print(X[0][0])

t=X[0][0]

print((1-pow((1-t),M,mod))%mod)