#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;

#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592

const double EPS = 1e-10;

using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;



int main(){
  ll p,k; cin >> p >> k;
  vector<ll> ans(k+1);
  ans[0] = 1;
  ll sum = 1;
  rep(i,k){
    ll now = (sum-ans[i])%MOD;
    if(now < 0) now += MOD;
    ans[i+1] = (ans[i]*(p+1)%MOD+now*2%MOD)%MOD;
    sum *= p*2%MOD;
    sum %= MOD;
  }
  cout << ans[k] << endl; 
}