#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 10, mod = 1e9 + 7;
int dp[N][N];
int pw(int x, int y) {
  int ret = 1;
  for (; y; y /= 2) {
    if (y & 1) ret = 1ll * ret * x % mod;
    x = 1ll * x * x % mod;
  }
  return ret;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  int ans = 0;
  dp[0][0] = 1;
  for (int i = 1; i <= k; i++)
    for (int j = 1; j <= i; j++) {
      dp[i][j] = (1ll * dp[i - 1][j] * j % mod +
                  1ll * dp[i - 1][j - 1] * (n - j + 1) % mod) %
                 mod;
      if (i == k) (ans += 1ll * dp[i][j] * pw(2, n - j) % mod) %= mod;
    }
  cout << ans;
  return 0;
}
