#include #pragma GCC optimize("Ofast") #define _GLIBCXX_DEBUG using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; ll ILL=1167167167167167167; const int INF=2100000000; const ll mod=1e9+7; #define rep(i,a) for (ll i=0;i using _pq = priority_queue, greater>; template ll LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template ll UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template bool chmax(T &a,const T &b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";} vector> v_mul(vector> a,vector> b){ int A=a.size(),B=a[0].size(),C=b.size(),D=b[0].size(); vector> r(A,vector(D)); for(int i=0;i> v_jyo(vector> a,int64_t N){ int m=a.size(); ll H=1; vector> r(m,vector(m,0)); for(int i=0;i0){ H*=2; if(N%H){ N-=(H/2); r=v_mul(r,a); } a=v_mul(a,a); } return r; } ll my_pow(ll a,ll b){ if(b==0) return 1; if(b&1) return (a*my_pow(a,b^1))%mod; return my_pow((a*a)%mod,b>>1); } // rainy ~ 雨に打たれて ~ int main() { ios::sync_with_stdio(false); cin.tie(nullptr); ll C,N,M; cin>>C>>N>>M; ll rev=my_pow(C,mod-2); vector> p={ {0,1,0,0}, {0,rev,rev,0}, {0,0,0,1}, {((C-1)*rev)%mod,0,((C-2)*rev)%mod,rev} }; p=v_jyo(p,N+1); cout<<(1-my_pow(((1-p[0][1]))%mod,M)+mod*2)%mod<<"\n"; }