#include<bits/stdc++.h>
using namespace std;
using ll = long long;
template<class T> using vt = vector<T>;
template<class T> using vvt = vector<vt<T>>;
template<class T> using ttt = tuple<T,T>;
using tii = tuple<int,int>;
using vi = vector<int>;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define DIV ll(1e9+7)
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-8;
//const double PI = M_PI;  
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}
inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;}
// IT 5000兆　欲しい
/* Coding space */
using Array = vector<ll>;
using Matrix = vector<Array>;

// O( n )
Matrix identity(ll n) {
  Matrix A(n, Array(n));
  for (int i = 0; i < n; ++i) A[i][i] = 1;
  return A;
}
// O( n^2 )
Array mul(const Matrix &A, const Array &x) {
  Array y(A.size());
  for (int i = 0; i < (int)A.size(); ++i)
    for (int j = 0; j < (int)A[0].size(); ++j)
      y[i] = (A[i][j] * x[j]) % DIV;
  return y;
}
// O( n^3 )
Matrix mul(const Matrix &A, const Matrix &B) {
  Matrix C(A.size(), Array(B[0].size()));
  for (int i = 0; i < (int)C.size(); ++i)
    for (int j = 0; j < (int)C[i].size(); ++j)
      for (int k = 0; k < (int)A[i].size(); ++k)
        C[i][j] += A[i][k] * B[k][j] % DIV, C[i][j] %= DIV;
  return C;
}
// O( n^3 log e )

Matrix pow(const Matrix &A, ll e) {
  return e == 0 ? identity(A.size())  :
     e % 2 == 0 ? pow(mul(A, A), e/2) : mul(A, pow(A, e-1));
}


int main(){
  ll b,c,d; cin >> b >> c >> d;
  b %= DIV; c%= DIV;
  Matrix A = {{c,b},{0,1}};
  A = pow(A,d);
  Array B = {b,1};
  Array Ans = mul(A,B);
  ll ans = Ans[0];
  cout << (ans * c) % DIV << endl;
}