#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <deque>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <cassert>
#include <iostream>
#include <stdio.h>
#include <time.h>
 
using namespace std;
 
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
 
#define MOD 1000000007

long long modpow(long long a, long long b){ 
  long long r = 1LL;

  while(b){
    if(a >= MOD)a %= MOD;
    if(b & 1LL)r *= a;
    if(r >= MOD)r %= MOD;
    a *= a;
    if(a >= MOD)a %= MOD;
    b >>= 1LL;
  }
  return r%MOD;
}

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