#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(ll i=0;i<n;i++)
constexpr ll MOD = 998244353;
const int MAX_N = 300300;
vector<ll> fac(MAX_N), finv(MAX_N), inv(MAX_N);
void init(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i=2;i<MAX_N;i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll mcomb(int n, int k){
    if(n<k) return 0;
    if(n<0 || k<0) return 0;
    return fac[n] * (finv[k] * finv[n-k] % MOD) % MOD;
}

ll sqrtz(ll N){
    ll n=sqrt(N);
    for(ll i=max(1ll,n-5);i<=n+5;i++){
        if(i*i>N)return i-1;
    }
    return n;
}

int main(){
    int t;
    cin >> t;
    init();
    while(t--){
        ll n,k;
        cin >> n >> k;
        ll N=n;
        ll d=(N+1)*(N+1)-4*k;
        if(d<0){
            cout<<0<<endl;
            continue;
        }
        ll z=sqrtz(d);
        
        if(z*z!=d){
            cout<<0<<endl;
            continue;
        }
        ll a, b;

        if((N+1+z)%2!=0){
            cout<<0<<endl;
            continue;
        }

        a=(N+1+z)/2;
        b=(N+1-z)/2;
        //cout<<a<<" "<<b<<endl;
        ll an=0;
        rep(i,2){
            swap(a,b);
            if(a<1||b<0)continue;
            an+=mcomb(N,a-1);
            an%=MOD;
            if(a==b)break;
        }
        cout<<an<<endl;


    }
}