You have a team of N people. For a particular task, you can pick any non-empty subset of people. The cost of having x people for the task is xk. 

Output the sum of costs over all non-empty subsets of people.

Input

Only line of input contains two integers N (1 ≤ N ≤ 109) representing total number of people and k (1 ≤ k ≤ 5000).

Output

Output the sum of costs for all non empty subsets modulo 109 + 7.

Examples

Input

1 1


Output

1


Input

3 2


Output

24

Note

In the first example, there is only one non-empty subset {1} with cost 11 = 1.

In the second example, there are seven non-empty subsets.

- {1} with cost 12 = 1

- {2} with cost 12 = 1

- {1, 2} with cost 22 = 4

- {3} with cost 12 = 1

- {1, 3} with cost 22 = 4

- {2, 3} with cost 22 = 4

- {1, 2, 3} with cost 32 = 9

The total cost is 1 + 1 + 4 + 1 + 4 + 4 + 9 = 24.
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
long long quickpow(long long p, long long k) {
  long long ans = 1;
  while (k) {
    if (k & 1) ans = (ans * p) % mod;
    p = (p * p) % mod;
    k >>= 1;
  }
  return ans;
}
long long n, k;
long long dp[5005][5005];
long long dfs(long long a, long long b) {
  if (b > n) return 0;
  if (dp[a][b] != -1) return dp[a][b];
  if (a == 0) return dp[a][b] = quickpow(2, n - b);
  return dp[a][b] =
             (b * dfs(a - 1, b) % mod + (n - b) * dfs(a - 1, b + 1) % mod) %
             mod;
}
int main() {
  memset(dp, -1, sizeof(dp));
  scanf("%I64d%I64d", &n, &k);
  printf("%I64d\n", dfs(k, 0));
}
