#include <bits/stdc++.h>

namespace Initial {
	#define ll long long
	#define ull unsigned long long
	#define fi first
	#define se second
	#define mkp make_pair
	#define pir pair <int, int>
	#define pb emplace_back
	#define i128 __int128
	using namespace std;
	const ll maxn = 2e5 + 10, inf = 1e9, mod = 1e9 + 7;
	ll power(ll a, ll b = mod - 2) {
		ll s = 1;
		while(b) {
			if(b & 1) s = 1ll * s * a %mod;
			a = 1ll * a * a %mod, b >>= 1;
		} return s;
	}
	template <class T>
	const inline ll pls(const T x, const T y) { return x + y >= mod? x + y - mod : x + y; }
	template <class T>
	const inline void add(T &x, const T y) { x = x + y >= mod? x + y - mod : x + y; }
	template <class T>
	const inline void chkmax(T &x, const T y) { x = x < y? y : x; }
	template <class T>
	const inline void chkmin(T &x, const T y) { x = x > y? y : x; }
} using namespace Initial;

namespace Read {
	char buf[1 << 22], *p1, *p2;
//	#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, (1 << 22) - 10, stdin), p1 == p2)? EOF : *p1++)
	template <class T>
	const inline void rd(T &x) {
		char ch; bool neg = 0;
		while(!isdigit(ch = getchar()))
			if(ch == '-') neg = 1;
		x = ch - '0';
		while(isdigit(ch = getchar()))
			x = (x << 1) + (x << 3) + ch - '0';
		if(neg) x = -x;
	}
} using Read::rd;

ll t, n, m, fac[maxn], ifac[maxn], N = 2e5, pw[maxn];

signed main() {
	rd(t), fac[0] = pw[0] = 1;
	for(ll i = 1; i <= N; i++)
		fac[i] = fac[i - 1] * i %mod, pw[i] = pw[i - 1] * (mod - mod / 2) %mod;
	ifac[N] = power(fac[N]);
	for(ll i = N; i; i--) ifac[i - 1] = ifac[i] * i %mod;
	while(t--) {
		rd(n), rd(m);
		if(m > n) puts("0");
		else if(m == n) printf("%lld\n", (mod - mod / 2) * fac[n - 1] %mod);
		else {
			ll ans = 0; m = n - m;
			for(ll i = 0; i <= m; i++) {
				ll now = n - m - i;
				if(!i) add(ans, (!now) * ifac[m]);
				else if(now >= 0)
					add(ans, ifac[i] * ifac[m - i] %mod * ifac[i - 1] %mod * ifac[now]
					 %mod * fac[i - 1 + now] %mod * pw[i] %mod);
			} printf("%lld\n", ans * fac[n] %mod);
		}
	}
	return 0;
}