#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#define N 3111111
#define z 3000000
#define mod 1000000007ll
ll n, m, t, fac[N] = {1}, ifac[N], p[N] = {1};
ll qpow(ll x, ll y){
	ll ans = 1, tmp = x;
	while(y){
		if(y & 1)
			ans = (ans * tmp) % mod;
		tmp = (tmp * tmp) % mod;
		y >>= 1;
	}
	return ans;
}
ll calc(ll x, ll y){
	if(x < y)
		return 0;
	return fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}
int main(){
	for(int i = 1 ; i <= z ; i++)
		fac[i] = fac[i - 1] * i % mod, p[i] = p[i - 1] * 2ll % mod;
	ifac[z] = qpow(fac[z], mod - 2);
	for(int i = z - 1 ; i >= 0 ; i--)
		ifac[i] = ifac[i + 1] * (i + 1) % mod;
	//cout << ifac[0];
	scanf("%lld", &t);
	for(int i = 1 ; i <= t ; i++){
		scanf("%lld%lld", &n, &m);
		printf("%lld\n", p[n - 3] * (n - 2) % mod * calc(m, n - 1) % mod);
	}
	return 0;
}