// Code by Heratino & Nelofus
#include <bits/stdc++.h>
using i64 = long long;

//{{{
template<typename T>
inline void chkmin(T &a, const T &b) {if (a > b)	a = b;}
template<typename T>
inline void chkmax(T &a, const T &b) {if (a < b)	a = b;}
//}}}

constexpr int N = 3e5 + 10;
constexpr int mod = 1e9 + 7;
inline int fpow(int x, int k) {
	int res = 1;
	for (; k; k >>= 1, x = 1ll * x * x % mod)
		if (k & 1)
			res = 1ll * res * x % mod;
	return res;
}
inline int Add(const int &x, const int &y) {return x + y >= mod ? x + y - mod : x + y;}
inline int Sub(const int &x, const int &y) {return x - y < 0 ? x - y + mod : x - y;}
inline int Mul(const int &x, const int &y) {return 1ll * x * y % mod;}
inline int Div(const int &x, const int &y) {return Mul(x, fpow(y, mod - 2));}
inline void AddTo(int &x, const int &y) {x = Add(x, y);}
inline void SubTo(int &x, const int &y) {x = Sub(x, y);}
inline void MulTo(int &x, const int &y) {x = Mul(x, y);}
inline void DivTo(int &x, const int &y) {x = Div(x, y);}

int fac[N], ifac[N], inv[N], pw[N];
inline int binom(int x, int y) {
	if (x < 0 || y < 0 || y > x)	return 0;
	return Mul(fac[x], Mul(ifac[x - y], ifac[y]));
}

inline void solve() {
	int n, m;
	std::cin >> n >> m;
	if (m > n) {
		std::cout << "0" << '\n';
		return ;
	}
	if (m == n) {
		std::cout << Mul(fac[n - 1], fpow(2, mod - 2)) << '\n';
		return ;
	}
	if (m == 0) {
		std::cout << "1" << '\n';
		return ;
	}
	int k = n - m;
	int ans = 0;
	for (int i = 0, u = n - k; i <= u; i++) {
		if (i > k)	break;
		int j = u - i;
		int t = (i & 1 ? Sub : Add)(0, Mul(binom(k, i), pw[k - i]));
		t = Mul(t, binom(k + j - 1, j));
		AddTo(ans, t);
	}
	ans = Mul(ans, fpow(pw[k], mod - 2));
	std::cout << Mul(ans, Mul(ifac[k], fac[n])) << '\n';
}

int main() {
#ifdef HeratinoNelofus
	freopen("input.txt", "r", stdin);
#endif
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	fac[0] = 1, pw[0] = 1;
	for (int i = 1; i < N; i++)
		fac[i] = Mul(fac[i - 1], i), pw[i] = Mul(pw[i - 1], 2);
	ifac[N - 1] = Div(1, fac[N - 1]);
	for (int i = N - 2; i >= 0; i--)
		ifac[i] = Mul(ifac[i + 1], i + 1);
	for (int i = 1; i < N; i++)
		inv[i] = Mul(ifac[i], fac[i - 1]);
	int T;
	std::cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}