b, c, n = map(int, input().split())
mod = 10**9 + 7


def cal(X):
    #return c**X+    .... c
    if X == 1:
        return c % mod
    elif X == 0:
        return 1

    else:
        if X % 2 == 0:
            K = cal(X//2)
            return K*(pow(c, X//2, mod)+1) % mod
        elif X % 2 != 0:
            return (pow(c, X, mod)+cal(X-1)) % mod


if c == 1:
    print(b*n % mod)
    exit()
else:
    ans = b*cal(n)
    print(ans % mod)
    exit()