#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod=1e9+7;
int fac[3000005],ifac[3000005];
int qkp(int b,int p){
    int r=1;
    while(p){
        if(p&1)(r*=b)%=mod;
        p/=2;
        (b*=b)%=mod;
    }
    return r;
}
int C(int n,int m){
    if(n<m)return 0;
    return fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
void solve(){
    int n,m;
    cin>>n>>m;
    cout<<C(m,n-1)*(n-2)%mod*qkp(2,n-3)%mod<<"\n";
    //先给一个上升的.
    //1 1 2
    //1 1 3
    //2 2 3
    //1 2 2 3 4.
    //C(m,n-1)*(n-2)*
    //i=0~n-3
    //2^(n-3)
    //C(n-3,i-2)
    //1<=x1<x2<...<xn<=m.
}
signed main(){
    fac[0]=1;
    for(int i=1;i<=3000000;i++)fac[i]=fac[i-1]*i%mod;
    ifac[3000000]=qkp(fac[3000000],mod-2);
    for(int i=2999999;i>=0;i--){
        ifac[i]=ifac[i+1]*(i+1)%mod;
    }
    int t;
    cin>>t;
    while(t--)solve();
    return 0;
}