#include <bits/stdc++.h>

template <class T>
inline void read(T &res)
{
	char ch; bool flag = false; res = 0;
	while (ch = getchar(), !isdigit(ch) && ch != '-');
	ch == '-' ? flag = true : res = ch ^ 48;
	while (ch = getchar(), isdigit(ch))
		res = res * 10 + ch - 48;
	flag ? res = -res : 0; 
}

template <class T>
inline void put(T x)
{
	if (x > 9)
		put(x / 10);
	putchar(x % 10 + 48);
}

template <class T>
inline void CkMin(T &x, T y) {x > y ? x = y : 0;}

const int N = 2e5 + 5;
const int lim = 2e5;
const int mod = 1e9 + 7;
int T_data, n, m;
int a[N], b[N], ex[N], iex[N], fac[N], ifac[N]; 

inline int quick_pow(int x, int k)
{
	int res = 1;
	while (k)
	{
		if (k & 1)
			res = 1ll * res * x % mod;
		x = 1ll * x * x % mod;
		k >>= 1;
	}
	return res;
}

inline int C(int n, int m)
{
	return 1ll * fac[n] * ifac[n - m] % mod * ifac[m] % mod;
}

inline void add(int &x, int y)
{
	x += y;
	x >= mod ? x -= mod : 0;
}

inline void dec(int &x, int y)
{
	x -= y;
	x < 0 ? x += mod : 0;
}

int main()
{
	fac[0] = ex[0] = 1;
	for (int i = 1; i <= lim; ++i)
		add(ex[i] = ex[i - 1], ex[i - 1]);
	iex[lim] = quick_pow(ex[lim], mod - 2);
	for (int i = lim; i >= 1; --i)
		add(iex[i - 1] = iex[i], iex[i]);
	for (int i = 1; i <= lim; ++i)
		fac[i] = 1ll * i * fac[i - 1] % mod;
	ifac[lim] = quick_pow(fac[lim], mod - 2);
	for (int i = lim; i >= 1; --i)
		ifac[i - 1] = 1ll * ifac[i] * i % mod;
	
	read(T_data);
	while (T_data--)
	{
		read(n); read(m);
		if (m == n)
			puts("1");
		else if (m > n)
			puts("0");
		else 
		{
			int k = n - m;
			for (int i = 0; i <= k; ++i)
			{
				b[i] = 1ll * ex[k - i] * C(k, i) % mod;
				if ((i & 1) && b[i])
					b[i] = mod - b[i];
			}
			for (int i = k; i <= n; ++i)
				a[i] = b[i - k];
			int ans = 0;
			for (int i = k; i <= n; ++i)
				ans = (1ll * C(n - i + k - 1, k - 1) * a[i] + ans) % mod;
			ans = 1ll * fac[n] * ifac[k] % mod * iex[k] % mod * ans % mod; 
			put(ans), putchar('\n');
			for (int i = 0; i <= n; ++i)
				a[i] = b[i] = 0;
		}
	}
	
}