#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

typedef vector<ll> vec;
typedef vector<vec> mat;
const ll MOD = 1000000007;
mat mul(mat &A, mat &B){ // A*B
  mat C(A.size(), vec(B[0].size()));
  rep(i,A.size()) rep(k,B.size()){
    rep(j,B[0].size()){
      C[i][j] = ((C[i][j]%MOD)+(A[i][k]%MOD)*(B[k][j]%MOD))%MOD;
    }
  }
  return C;
}
mat pow(mat A, ll n){ // A^n
  mat B(A.size(), vec(A.size()));
  rep(i,A.size()) B[i][i] = 1;
  while(n>0){
    if(n&1) B=mul(B,A);
    A=mul(A,A);
    n>>=1;
  }
  return B;
}
vector<ll> mulv(mat &A, vector<ll> v){
  vector<ll> ret = v;
  rep(i,v.size()){
    ll res = 0;
    rep(j,v.size()){ res += ((A[i][j]%MOD)*(v[j]%MOD))%MOD; res = res%MOD; }
    ret[i] = res%MOD;
  }
  return ret;
}

int main(){
  ll B, C, D;
  cin >> B >> C >> D;
  B %= MOD;
  C %= MOD;
  
  vec a0 = {(B*C)%MOD,0,1};
  mat A = {{C,0,(B*C)%MOD},{1,0,0},{0,0,1}};
  mat nA = pow(A, D-1);
  vec ret = mulv(nA, a0);
  
  cout << ret[0] << endl;
  
  return 0;
}