【Polo the Penguin and Houses】【CodeForces - 288B】（purfer序列+思维）

题目：

Little penguin Polo loves his home village. The village has n houses, indexed by integers from 1 to n. Each house has a plaque containing an integer, the i-th house has a plaque containing integer pi (1 ≤ pi ≤ n).

Little penguin Polo loves walking around this village. The walk looks like that. First he stands by a house number x. Then he goes to the house whose number is written on the plaque of house x (that is, to house px), then he goes to the house whose number is written on the plaque of house px (that is, to house ppx), and so on.

We know that:

1. When the penguin starts walking from any house indexed from 1 to k, inclusive, he can walk to house number 1.
2. When the penguin starts walking from any house indexed from k + 1 to n, inclusive, he definitely cannot walk to house number 1.
3. When the penguin starts walking from house number 1, he can get back to house number 1 after some non-zero number of walks from a house to a house.

You need to find the number of ways you may write the numbers on the houses' plaques so as to fulfill the three above described conditions. Print the remainder after dividing this number by 1000000007 (109 + 7).

Input

The single line contains two space-separated integers n and k (1 ≤ n ≤ 1000, 1 ≤ k ≤ min(8, n)) — the number of the houses and the number k from the statement.

Output

In a single line print a single integer — the answer to the problem modulo 1000000007 (109 + 7).

Examples

Input

5 2

Output

54

Input

7 4

Output

1728

解题报告：当时做的时候就是自己入坑，拼命赵数学规律，排列组合，最后找出来一个规律：k^(k-1)*(n-k)^(n-k)。但是当时没有找到一个合适的解释对于k^(k-1)。最后结束之后大佬告诉我是purfer序列，我也没有细研究，以后待补。

ac代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
typedef long long ll;
#define mod 1000000007
int main()
{
	int n,k;
	scanf("%d%d",&n,&k);
	ll res=1;
	for(int i=0;i<k-1;i++)
	{
		res=res*k%mod;
	}
	for(int i=1;i<=n-k;i++)
	{
		res=res*(n-k)%mod;
	}
	printf("%lld\n",res);
	return 0;
}