#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod= 1000000007;
int jie[2000005],inv[2000005];
int n,m;
int qp(int p,int q){
	int ans = 1,pro = p;
	while(q){
		if(q&1)ans = ans*pro%mod;pro= pro*pro%mod;q>>=1;
	}return ans;
}int C(int n,int m){
	return jie[n]*inv[m]%mod*inv[n-m]%mod;
}int A(int n,int m){
	return jie[n]*inv[n-m]%mod;
}
void solve(){
	cin >> n >> m;
	int ans = 0,f=1;
	for(int i = n;i>=0;i--){
		ans+=f*(C(n,i)*A(m,n-i)%mod*A(m-n+i,i)%mod*A(m-n+i,i))%mod;f*=-1;
		ans%=mod;ans+=mod;ans%=mod;
	}cout << ans << '\n';
}
signed main(){
	jie[0] = inv[0] = 1;
	for(int i = 1;i<=2000000;i++)jie[i] = jie[i-1]*i%mod,inv[i] = qp(jie[i],mod-2);
	int t;cin >> t;
	while(t--){
		solve();
	}
	return 0;
}