#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;

long long mod_pow(long long x, long long n){
   if(n == 0) return 1;
   long long res = mod_pow(x*x % mod, n / 2);
   if(n & 1) res = res*x % mod;
   return res;
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int b, c, d;
    cin >> b >> c >> d;
    b %= mod;
    c %= mod;
    int ans = b * c % mod * ((mod_pow(c % mod, d) - 1 + mod) % mod) % mod * mod_pow((c - 1 + mod) % mod, mod - 2) % mod;
    if(c == 1) ans = (b * (d % mod)) % mod;
    cout << ans << endl;
}