#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#include <bits/stdc++.h>
using namespace std;

#define MOD 1000000007


int main() {
  ll p,k;
  cin>>p>>k;
  
  ll a[k+1],b[k+1];
  a[0]=1,b[0]=0;
  
  for(ll i=1;i<k+1;i++){
    a[i]=((1+p)*a[i-1]+2*b[i-1])%MOD;
    b[i]=((2*p-2)*b[i-1]+(p-1)*a[i-1])%MOD;
  }
  
  cout<<a[k]<<endl;
  
  

  return 0;
}