#include <stdio.h>
#include <string.h>

#include <vector>
#include <algorithm>

#define eb emplace_back

#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long long LL;

constexpr int N = 100005, mod = 1e9 + 7, inv2 = (mod + 1) / 2;

constexpr int inv(int x, int k = mod - 2) {
	int r = 1;
	while (k) {
		if (k & 1) {
			r = x * (LL)r % mod;
		}
		x = x * (LL)x % mod;
		k >>= 1;
	}
	return r;
}

int fact[N], infact[N];

void pref() {
	constexpr int n = N - 1;
	*fact = 1;
	for (int i = 1; i <= n; ++i) {
		fact[i] = fact[i - 1] * (LL)i % mod;
	}
	infact[n] = inv(fact[n]);
	for (int i = n; i; --i) {
		infact[i - 1] = infact[i] * (LL)i % mod;
	}
}

int C(int x, int y) {
	return y < 0 || x < y ? 0 : fact[x] * (LL)infact[y] % mod * infact[x - y] % mod;
}

int solve() {
	int n; LL m;
	scanf("%d%lld", &n, &m);
	if (m > n) return 0;
	if (m == n) return fact[n - 1] * (LL)inv2 % mod;
	m = n - m;
	constexpr int w = mod - inv2;
	int r = 1, s = 0;
	for (int k = 0; k <= m; ++k) {
		s = (s + C(n - k - 1, m - 1) * (LL)C(m, k) % mod * r) % mod;
		r = r * (LL)w % mod;
	}
	s = s * (LL)fact[n] % mod * infact[m] % mod;
	return s;
}

int main() {
	pref();
	int task;
	for (scanf("%d", &task); task--; ) {
		printf("%d\n", solve());
	}
	return 0;
}