//#include <bits/stdc++.h>
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <iomanip>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <time.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;

#define fi first
#define se second
#define mp make_pair
 
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll INF = 1ll << 60;
const double PI = 2 * asin(1);

void yes() {printf("yes\n");}
void no() {printf("no\n");}
void Yes() {printf("Yes\n");}
void No() {printf("No\n");}
void YES() {printf("YES\n");}
void NO() {printf("NO\n");}

ll P, K, sum = 1, DP[2][int(1e6 + 5)];

int main(){
  cin >> P >> K;
  DP[0][0] = 1;

  for (int i = 1; i <= K; i++){
    sum *= 2 * P; sum %= MOD;

    DP[1][i] = DP[0][i - 1] + DP[1][i - 1] * (P - 1) * 2;
    DP[1][i] %= MOD;

    DP[0][i] = sum - DP[1][i] * (P - 1);
    DP[0][i] %= MOD;
    if (DP[0][i] < 0) DP[0][i] += MOD; 
  }
  
  cout << DP[0][K] << endl;

  return 0;
}