#include <cstdio>
#define mod 1000000007
int qpow(int a, int b) {
	int ans = 1;
	for (; b; b >>= 1, a = a * 1ll * a % mod)
		if (b & 1) ans = ans * 1ll * a % mod;
	return ans;
}
int T, n;
long long m;
int fac[200010], ifac[200010], ffac[200010];
main() {
	n = 2e5, fac[0] = ffac[0] = 1;
	for (int i = 1; i <= n; ++i) fac[i] = fac[i - 1] * 1ll * i % mod;
	ifac[n] = qpow(fac[n], mod - 2);
	for (int i = n; i; --i) ifac[i - 1] = ifac[i] * 1ll * i % mod;
	for (int i = 1; i <= n / 2; ++i) ffac[i] = ffac[i - 1] * (2ll * i - 1) % mod;
	for (int i = 1; i <= n / 2; ++i) ffac[i] = ffac[i] * 1ll * ifac[i * 2] % mod * ifac[i - 1] % mod;
	for (scanf("%d", &T); T--; ) {
		scanf("%d%lld", &n, &m);
		if (m > n) { puts("0"); continue; }
		if (m == 0) { puts("1"); continue; }
		if (n == m) {
			printf("%d\n", (fac[n - 1] + (fac[n - 1] % 2? mod: 0)) / 2);
			continue;
		}
		int ans = 0;
		for (int i = 1; i <= n - m; ++i) 
			ans = (ans + 1ll * ifac[n - m - i] * ffac[i] % mod * ifac[m - i]) % mod;
		printf("%d\n", ans * 1ll * fac[n] % mod * fac[m - 1] % mod);
	}
}