#include<bits/stdc++.h> #include<unordered_set> #include<unordered_map> using namespace std; #define int long long #define REP(i,m,n) for(int i=(m);i<(n);i++) #define rep(i,n) REP(i,0,n) #define pb push_back #define all(a) a.begin(),a.end() #define rall(c) (c).rbegin(),(c).rend() #define mp make_pair #define endl '\n' typedef long long ll; typedef pair<ll,ll> pll; typedef long double ld; const ll inf=1e9+7; const ll mod=1e9+7; signed main(){ ll p,k;cin>>p>>k; vector<vector<ll> >dp(k+1,vector<ll>(2)); dp[0][0]=1; rep(i,k){ dp[i+1][1]=(dp[i+1][1]+dp[i][0]*(p-1)%mod)%mod; dp[i+1][0]=(dp[i+1][0]+dp[i][0]*(p+1)%mod)%mod; dp[i+1][0]=(dp[i+1][0]+dp[i][1]*(2)%mod)%mod; dp[i+1][1]=(dp[i+1][1]+dp[i][1]*(2*p-2)%mod)%mod; } cout<<dp[k][0]<<endl; }