Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Maximum Element

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputOne day Petya was solving a very interesting problem. But although he used many optimization techniques, his solution still got Time limit exceeded verdict. Petya conducted a thorough analysis of his program and found out that his function for finding maximum element in an array of *n* positive integers was too slow. Desperate, Petya decided to use a somewhat unexpected optimization using parameter *k*, so now his function contains the following code:

int fast_max(int n, int a[]) {

int ans = 0;

int offset = 0;

for (int i = 0; i < n; ++i)

if (ans < a[i]) {

ans = a[i];

offset = 0;

} else {

offset = offset + 1;

if (offset == k)

return ans;

}

return ans;

}

That way the function iteratively checks array elements, storing the intermediate maximum, and if after *k* consecutive iterations that maximum has not changed, it is returned as the answer.

Now Petya is interested in fault rate of his function. He asked you to find the number of permutations of integers from 1 to *n* such that the return value of his function on those permutations is not equal to *n*. Since this number could be very big, output the answer modulo 10^{9} + 7.

Input

The only line contains two integers *n* and *k* (1 ≤ *n*, *k* ≤ 10^{6}), separated by a space — the length of the permutations and the parameter *k*.

Output

Output the answer to the problem modulo 10^{9} + 7.

Examples

Input

5 2

Output

22

Input

5 3

Output

6

Input

6 3

Output

84

Note

Permutations from second example:

[4, 1, 2, 3, 5], [4, 1, 3, 2, 5], [4, 2, 1, 3, 5], [4, 2, 3, 1, 5], [4, 3, 1, 2, 5], [4, 3, 2, 1, 5].

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/16/2019 21:05:30 (e2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|