组合数+错排
答案 = C(n,m) * h(n-m)
#include<cstdio>
#define MOD 1000000007
#define N 1000005
using namespace std;
namespace runzhe2000
{
typedef long long ll;
int h[N], fac[N], inv[N];
void main()
{
h[0] = 1;
for(int i = 2; i < N; i++)
h[i] = (ll) (i-1) * (h[i-1] + h[i-2]) % MOD;
fac[0] = 1;
for(int i = 1; i < N; i++)
fac[i] = (ll) fac[i-1] * i % MOD;
inv[1] = 1;
for(int i = 2; i < N; i++)
inv[i] = (ll) (MOD - MOD / i) * inv[MOD % i] % MOD;
inv[0] = 1;
for(int i = 1; i < N; i++)
inv[i] = (ll) inv[i-1] * inv[i] % MOD;
int T; scanf("%d",&T);
for(; T--; )
{
int n, m; scanf("%d%d",&n,&m);
if(n < m ){printf("0\n"); continue; }
ll ans = (ll)fac[n] * inv[m] % MOD * inv[n-m] % MOD * h[n-m] % MOD;
printf("%lld\n",ans);
}
}
}
int main()
{
runzhe2000::main();
}