#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
//using mint=modint998244353;
vector<vector<mint>>pow(vector<vector<mint>>A,ll N){
  vector<vector<mint>>res(4,vector<mint>(4)),p(4,vector<mint>(4));
  REP(i,4)res[i][i]=1;
  while(N){
    if(N%2){
      //res*=A
      REP(i,4)REP(j,4)p[i][j]=0;
      REP(i,4)REP(j,4)REP(k,4)p[i][j]+=res[i][k]*A[k][j];
      REP(i,4)REP(j,4)res[i][j]=p[i][j];
    }
    N/=2;
    //A*=A
    REP(i,4)REP(j,4)p[i][j]=0;
    REP(i,4)REP(j,4)REP(k,4)p[i][j]+=A[i][k]*A[k][j];
    REP(i,4)REP(j,4)A[i][j]=p[i][j];
  }
  return res;
}
signed main(){
  ll C,N,M;cin>>C>>N>>M;
  vector<vector<mint>>A(4,vector<mint>(4));
  A[0][0]=inv_mod(C,1000000007);
  A[0][1]=1;
  A[1][2]=A[0][0];
  A[2][2]=A[0][0];
  A[2][3]=1;
  A[3][0]=(C-1)*A[0][0];
  A[3][2]=(C-2)*A[0][0];
  mint ans=pow(A,N).at(0).at(0);
  ans=1-pow_mod((1-ans).val(),M,1000000007);
  cout<<ans.val()<<endl;
  return 0;
}