#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define P pair<ll,ll>
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x,t,f) ((x)?(t):(f))
#define SORT(x) (sort(x.begin(),x.end())) // 0 2 2 3 4 5 8 9
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin()) //xi>=v  x is sorted
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin()) //xi>v  x is sorted
#define NUM(x,v) (POSU(x,v)-POSL(x,v))  //x is sorted
#define REV(x) (reverse(x.begin(),x.end())) //reverse
ll gcd(ll a,ll b){if(a%b==0)return b;return gcd(b,a%b);}
ll lcm(ll a,ll b){ll c=gcd(a,b);return ((a/c)*(b/c)*c);}
#define NEXTP(x) next_permutation(x.begin(),x.end())
const ll INF=ll(1e16)+ll(7);
const ll MOD=1000000007LL;
#define out(a) cout<<fixed<<setprecision((a))
//tie(a,b,c) = make_tuple(10,9,87);
#define pop(a) __builtin_popcount((a))
ll keta(ll a){ll r=0;while(a){a/=10;r++;}return r;}




vector<ll> pow_(vector<ll> v,ll k,ll m){
  vector<ll> res(4,0);
  if(k==0){
    res[0] = res[3] = 1;
    return res;
  }
  if(k==1){
    return v;
  }
  auto x = pow_(v,k/2,m);
  res[0] = ( x[0]*x[0]%m + x[1]*x[2]%m ) %m;
  res[1] = ( x[0]*x[1]%m + x[1]*x[3]%m ) %m;
  res[2] = ( x[2]*x[0]%m + x[3]*x[2]%m ) %m;
  res[3] = ( x[2]*x[1]%m + x[3]*x[3]%m ) %m;
  if(k&1){
    x[0] = ( res[0]*v[0]%m + res[1]*v[2]%m ) %m;
    x[1] = ( res[0]*v[1]%m + res[1]*v[3]%m ) %m;
    x[2] = ( res[2]*v[0]%m + res[3]*v[2]%m ) %m;
    x[3] = ( res[2]*v[1]%m + res[3]*v[3]%m ) %m;
    return x;
  }
  return res;
}


int main(){


  ll M,K;
  cin >> M >> K;

  vector<ll> v = {M+1,2,M-1,2*M-2};
  auto x = pow_(v,K,MOD);
  ll ans = x[0];

// cout << x[0] << " " << x[1] << endl;
// cout << x[2] << " " << x[3] << endl;

  cout << ans << endl;

}