#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
const ll mod=998244353;
const int iu=1e5;
ll n,m;
ll f[iu+1],inf[iu+1];
ll pw(ll x,ll y){
	if(y==0) return 1;
	if(y%2) return x*pw(x,y-1)%mod;
	ll res=pw(x,y/2);
	return res*res%mod;
}
ll C(ll x,ll y){
	if(y>x) return 0;
	return f[x]*inf[y]%mod*inf[x-y]%mod;
}
ll solve(){
	ll ans=0;
	ll l=0,r=(n+1)/2;
	while(l!=r){
		ll mid=(l+r)/2;
		if(mid*(n-mid+1)>=m) r=mid;
		else l=mid+1;
	}
	if(l*(n-l+1)!=m) return 0;
	{
		int k=l;
		
			ans=(ans+C(n,k))%mod;
	}
	{
		int k=n-l+1;
		if(k==n+1 || k==l) return ans;
		
			ans=(ans+C(n,k))%mod;
		
	}
	
	return ans;
}
int main(){
	ios::sync_with_stdio(false);cin.tie(0);
	f[0]=1;
	for(int i=1; i<=iu ;i++) f[i]=f[i-1]*i%mod;
	inf[iu]=pw(f[iu],mod-2);
	for(int i=iu; i>=1 ;i--) inf[i-1]=inf[i]*i%mod;
	int t;cin >> t;
	while(t--){
		cin >> n >> m;
		cout << solve() << '\n';
	}
}