#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int mod=1e9+7;

ll mpow(ll a,ll b) {
    ll ans=1;
    while (b) {
        if (b&1)
            ans=(ans*a%mod+mod)%mod;
        a=a*a%mod;
        b>>=1;
    }
    return ans;
}

int main() {
    ll b,c,d;
    cin>>b>>c>>d;
    if (c==1) {
        cout<<b%mod*(d%mod)%mod<<endl;
        return 0;
    }
    b%=mod;
    c%=mod;
    cout<<(b*c%mod*(1-mpow(c,d))%mod+mod)%mod*mpow(1-c,mod-2)%mod<<endl;
    return 0;
}