Problem: We have N lamps numbered 1 to N, and N buttons numbered 1 to N. Initially, Lamp 1, 2, \cdots, A are on, and the other lamps are off.

Snuke and Ringo will play the following game.

* First, Ringo generates a permutation (p_1,p_2,\cdots,p_N) of (1,2,\cdots,N). The permutation is chosen from all N! possible permutations with equal probability, without being informed to Snuke.

* Then, Snuke does the following operation any number of times he likes:

* Choose a lamp that is on at the moment. (The operation cannot be done if there is no such lamp.) Let Lamp i be the chosen lamp. Press Button i, which switches the state of Lamp p_i. That is, Lamp p_i will be turned off if it is on, and vice versa.



At every moment, Snuke knows which lamps are on. Snuke wins if all the lamps are on, and he will surrender when it turns out that he cannot win. What is the probability of winning when Snuke plays optimally?

Let w be the probability of winning. Then, w \times N! will be an integer. Compute w \times N! modulo (10^9+7).

Constraints

* 2 \leq N \leq 10^7
* 1 \leq A \leq \min(N-1,5000)

Input

Input is given from Standard Input in the following format:


N A


Output

Print w \times N! modulo (10^9+7), where w is the probability of Snuke's winning.

Examples

Input

3 1


Output

2


Input

3 2


Output

3


Input

8 4


Output

16776


Input

9999999 4999


Output

90395416

Solution (in CPP):

Solution:
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e7 + 5;
int fac[N], ifac[N], inv[N];

int mul(int x, int y) { return x * 1ll * y % mod; }
int add(int x, int y) { return x+y < mod ? x+y : x+y-mod; }
int sub(int x, int y) { return x-y < 0 ? x-y+mod: x-y; }
int norm(int x) { return x < 0 ? add(x, mod) : sub(x, mod); }
template<class T, class... O> int mul(T x, O... y) { return mul(x, mul(y...)); }

int main() {
  int n, a; cin >> n >> a;
  fac[0] = ifac[0] = 1;
  for (int i = 1; i <= n; i++) {
    fac[i] = mul(fac[i-1], i);
    inv[i] = i == 1 ? 1 : mod - mul(mod / i, inv[mod % i]);
    ifac[i] = mul(ifac[i-1], inv[i]);
  }
  int ans = 0;
  for (int i = 1; i <= a+1; i++) // [1 .. i-1]
    for (int j = 0; j+1 < i; j++) // j singletons before
      ans = norm(ans + ((j & 1) ? -1 : 1) * mul(fac[i-1], ifac[j], ifac[i-2-j], fac[n-j-1], i == a+1 ? 1 : inv[n-a+i-1-j]));
  cout << ans << "\n";
  return 0;
}