#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7,M=2e6;
int fac[M+5],ifac[M+5];
int fmi(int k,int t){
	if(t==0)return 1;
	if(t==1)return k;
	int ans=fmi(k,t>>1);
	return 1ll*ans*ans%mod*fmi(k,t&1)%mod;
} 
int A(int a,int b){
	return 1ll*fac[b]*ifac[b-a]%mod;
}
int C(int a,int b){
	return 1ll*fac[b]*ifac[b-a]%mod*ifac[a]%mod;
}
void solve(){
	int n,m;scanf("%d%d",&n,&m);
	int ans=0;
	for(int i=0;i<=n;i++)ans=((1ll*ans+1ll*((i&1)?-1:1)*1ll*C(i,n)*A(n-i,m-i)%mod)%mod+mod)%mod;
	printf("%d\n",(1ll*A(n,m)*ans)%mod);
}
int main(){
	fac[0]=ifac[0]=1;
	for(int i=1;i<=M;i++)fac[i]=1ll*fac[i-1]*i%mod;
	ifac[M]=fmi(fac[M],mod-2);
	for(int i=M-1;i>=1;i--)ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
	int t;scanf("%d",&t);
	while(t--)solve(); 
}