#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)
#define MAX LONG_LONG_MAX

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int B,C,D;
int MOD = 1000000007;

int mod_pow(int b, int e, int m) {
    int result = 1;
    
    while (e > 0) {
        if ((e & 1) == 1) result = (result * b) % m;
        e >>= 1;
        b = (b * b) % m;
    }
    
    return result;
}

signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin>>B>>C>>D;
    
    if (C==1) {
        cout << ((B % MOD) * (D % MOD)) % MOD << endl;
        return 0;
    }
    
    /*
     BC * (C^D - 1) * (C - 1)^(-1)
     */
    int ans = ((B % MOD) * (C % MOD)) % MOD;
    int cc = mod_pow(C % MOD, D, MOD) - 1;
    if (cc<0) cc+= MOD;
    ans *= cc;
    ans %= MOD;
    
    int b = C % MOD - 1;
    if (b<0) b+=MOD;
    ans *= mod_pow(b, MOD-2, MOD);
    ans %= MOD;
    
    cout << ans << endl;

    return 0;
}