#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;
using mint = modint998244353;

struct modinv {
  int n; vector<mint> d;
  modinv(): n(2), d({0,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(-d[mint::mod()%n]*(mint::mod()/n)), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} invs;
struct modfact {
  int n; vector<mint> d;
  modfact(): n(2), d({1,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(d.back()*n), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} facts;
struct modfactinv {
  int n; vector<mint> d;
  modfactinv(): n(2), d({1,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(d.back()*invs(n)), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} ifacts;
mint comb(int n, int k) {
  if (n < k || k < 0) return 0;
  return facts(n)*ifacts(k)*ifacts(n-k);
}

void solve() {
    int n, a;
    cin >> n >> a;
    --n;
    
    mint ans;
    for (int d = 1; d*d <= a; ++d) {
        if (a%d) continue;
        int d1 = d, d2 = a/d;
        {
            int u = a/d1;
            if (u <= n and (n-u)%2 == 0) {
                int k = (n-u)/2;
                int kp = (n+u)/2+1;
                ans += comb(n, k) - comb(n, kp);
            }
        }
        if (d1 != d2) {
            int u = a/d2;
            if (u <= n and (n-u)%2 == 0) {
                int k = (n-u)/2;
                int kp = (n+u)/2+1;
                ans += comb(n, k) - comb(n, kp);
            }
        }
    }
    
    cout << ans.val() << '\n';
}

int main() {
	int t;
	cin >> t;
	
	while (t--) solve();
	
	return 0;
}