Problem: There are well-known formulas: <image>, <image>, <image>. Also mathematicians found similar formulas for higher degrees.

Find the value of the sum <image> modulo 109 + 7 (so you should find the remainder after dividing the answer by the value 109 + 7).

Input

The only line contains two integers n, k (1 ≤ n ≤ 109, 0 ≤ k ≤ 106).

Output

Print the only integer a — the remainder after dividing the value of the sum by the value 109 + 7.

Examples

Input

4 1


Output

10


Input

4 2


Output

30


Input

4 3


Output

100


Input

4 0


Output

4

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int prime = 999983;
const int INF = 0x7FFFFFFF;
const long long INFF = 0x7FFFFFFFFFFFFFFF;
const double pi = acos(-1.0);
const double inf = 1e18;
const double eps = 1e-6;
const long long mod = 1e9 + 7;
int dr[2][4] = {1, -1, 0, 0, 0, 0, -1, 1};
long long qpow(long long a, long long b) {
  long long ans = 1;
  while (b > 0) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
namespace polysum {
const int D = 1e6 + 10;
long long a[D], f[D], g[D], p[D], p1[D], p2[D], b[D], h[D][2], C[D];
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long calcn(int d, long long *a, long long n) {
  if (n <= d) return a[n];
  p1[0] = p2[0] = 1;
  for (int i = 0; i < d + 1; i++) {
    long long t = (n - i + mod) % mod;
    p1[i + 1] = p1[i] * t % mod;
  }
  for (int i = 0; i < d + 1; i++) {
    long long t = (n - d + i + mod) % mod;
    p2[i + 1] = p2[i] * t % mod;
  }
  long long ans = 0;
  for (int i = 0; i < d + 1; i++) {
    long long t =
        g[i] * g[d - i] % mod * p1[i] % mod * p2[d - i] % mod * a[i] % mod;
    if ((d - i) & 1)
      ans = (ans - t + mod) % mod;
    else
      ans = (ans + t) % mod;
  }
  return ans;
}
void init(int M) {
  f[0] = f[1] = g[0] = g[1] = 1;
  for (int i = 2; i < M + 5; i++) f[i] = f[i - 1] * i % mod;
  g[M + 4] = powmod(f[M + 4], mod - 2);
  for (int i = M + 4 - 1; i >= 1; i--) g[i] = g[i + 1] * (i + 1) % mod;
}
long long polysum(long long m, long long *a, long long n) {
  long long b[D];
  for (int i = 0; i <= m; i++) b[i] = a[i];
  b[m + 1] = calcn(m, b, m + 1);
  for (int i = 1; i < m + 2; i++) b[i] = (b[i - 1] + b[i]) % mod;
  return calcn(m + 1, b, n - 1);
}
long long qpolysum(long long R, long long n, long long *a, long long m) {
  if (R == 1) return polysum(n, a, m);
  a[m + 1] = calcn(m, a, m + 1);
  long long r = powmod(R, mod - 2), p3 = 0, p4 = 0, c, ans;
  h[0][0] = 0;
  h[0][1] = 1;
  for (int i = 1; i < m + 2; i++) {
    h[i][0] = (h[i - 1][0] + a[i - 1]) * r % mod;
    h[i][1] = h[i - 1][1] * r % mod;
  }
  for (int i = 0; i < m + 2; i++) {
    long long t = g[i] * g[m + 1 - i] % mod;
    if (i & 1)
      p3 = ((p3 - h[i][0] * t) % mod + mod) % mod,
      p4 = ((p4 - h[i][1] * t) % mod + mod) % mod;
    else
      p3 = (p3 + h[i][0] * t) % mod, p4 = (p4 + h[i][1] * t) % mod;
  }
  c = powmod(p4, mod - 2) * (mod - p3) % mod;
  for (int i = 0; i < m + 2; i++) h[i][0] = (h[i][0] + h[i][1] * c) % mod;
  for (int i = 0; i < m + 2; i++) C[i] = h[i][0];
  ans = (calcn(m, C, n) * powmod(R, n) - c) % mod;
  if (ans < 0) ans += mod;
  return ans;
}
}  // namespace polysum
const int maxn = 1e6 + 100;
long long a[maxn], b[maxn];
long long inv[maxn];
long long invfac[maxn];
long long fac[maxn];
int main(void) {
  long long n, k;
  cin >> n >> k;
  if (k == 0) return 0 * printf("%I64d", n);
  for (int i = 0; i <= k + 1; ++i) b[i] = qpow(i, k);
  for (int i = 0; i <= k + 1; ++i) b[i] = (b[i] + b[i - 1]) % mod;
  if (n <= k + 1) {
    cout << b[n] << endl;
    return 0;
  }
  fac[0] = 1;
  for (int i = 1; i <= k + 3; ++i) fac[i] = fac[i - 1] * i % mod;
  for (int i = 0; i <= k + 3; ++i) invfac[i] = qpow(fac[i], mod - 2);
  long long fac = 1;
  for (int i = 0; i <= k + 1; ++i) fac = fac * (n - i) % mod;
  long long ans = 0;
  for (int i = 0; i <= k + 1; ++i) {
    int t = ((k - i + 1) & 1) ? -1 : 1;
    ans += b[i] * fac % mod * qpow(n - i, mod - 2) % mod * invfac[i] % mod *
           invfac[k - i + 1] * t % mod;
    ans %= mod;
  }
  ans = (ans % mod + mod) % mod;
  cout << ans << endl;
  return 0;
}