#include <cstdio>
#include <iostream>
using namespace std;
const int N = 1000001, P = 1e9 + 7;
typedef long long LL;
int n, m, fact[N], infact[N];
int f[N];
int power (int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res = (LL)res * a % P;
		a = (LL)a * a % P;
		b >>= 1;
	}
	return res;
}
int C(int a, int b) {
	return (LL)fact[a] * infact[b] % P * infact[a - b] % P;
}
int main() {
	fact[0] = infact[0] = 1;
	for (int i = 1; i < N; i++) fact[i] = (LL)fact[i - 1] * i % P;
	infact[N - 1] = power(fact[N - 1], P - 2);
	for (int i = N - 2; i; i--) infact[i] = (LL)infact[i + 1] * (i + 1) % P;
	f[0] = f[2] = 1;
	for (int i = 3; i < N; i++) 
		f[i] = (LL)(i - 1) * (f[i - 1] + f[i - 2]) % P;
	int T; scanf("%d", &T);
	while (T--) {
		scanf("%d%d", &n, &m);
		printf("%d\n", (LL)C(n, m) * f[n - m] % P); 
	}
	return 0;
}