#include <bits/stdc++.h>

using i64 = long long;

constexpr int N = 1E5;
constexpr int P = 1E9 + 7;

int fac[N + 1], invfac[N + 1], inv[N + 1];

int power(int a, int b) {
	int res = 1;
	for (; b; b /= 2, a = 1LL * a * a % P) {
		if (b % 2) {
			res = 1LL * res * a % P;
		}
	}
	return res;
}

int binom(int n, int m) {
	if (n < m || m < 0) {
		return 0;
	}
	return 1LL * fac[n] * invfac[m] % P * invfac[n - m] % P;
}

void solve() {
	int n;
	i64 m;
	std::cin >> n >> m;

	if (n < m) {
		std::cout << 0 << "\n";
		return;
	}

	if (n == m) {
		std::cout << 1LL * fac[n - 1] * (P + 1) / 2 % P << "\n";
		return;
	}

	m = n - m;
	int ans = 0;
	for (int i = 0; i < m; i++) {
		ans = (ans + 1LL * binom(m, i) * binom(n - m + m - i - 1, m - i - 1)) % P;
	}
	ans = 1LL * ans * fac[n] % P * invfac[m] % P * power((P + 1) / 2, m) % P;
	std::cout << ans << "\n";
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	fac[0] = 1;
	for (int i = 1; i <= N; i++) {
		fac[i] = 1LL * fac[i - 1] * i % P;
	}
	invfac[N] = power(fac[N], P - 2);
	for (int i = N; i; i--) {
		invfac[i - 1] = 1LL * invfac[i] * i % P;
		inv[i] = 1LL * invfac[i] * fac[i - 1] % P;
	}

	int T;
	std::cin >> T;

	while (T--) {
		solve();
	}

	return 0;
}