#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    ll p, k;
    cin >> p >> k;
    ll dp[k+1][2];
    rep(i,k+1)rep(j,2)dp[i][j] = 0;
    dp[0][0] = 1;
    ll MOD = 1e9+7;
    srep(i,1,k+1){
        dp[i][0] = dp[i-1][0] * (p + 1) + dp[i-1][1] * (p - 1) % MOD * 2;
        dp[i][0] %= MOD;
        dp[i][1] = dp[i-1][0] + dp[i-1][1] * (p - 1) % MOD * 2;
        dp[i][1] %= MOD;
    }
    cout << dp[k][0] << endl;
    return 0;
}