#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll = long long;
using mint = atcoder::modint998244353;

template <class T> struct csr {
    using itr = typename std::vector<T>::iterator;
    struct Node {
        itr st, en;
        itr begin() { return st; }
        itr end() { return en; }
        int size() { return en - st; }
        T& operator[](int p){ return st[p]; }
    };
    const int N;
    std::vector<int> start;
    std::vector<T> E;
    std::vector<std::pair<int,T>> edge;
    csr(int n) : N(n), start(n + 1) {}
    void add_edge(int u, T v){
        assert(0 <= u && u < N);
        start[u + 1]++;
        edge.emplace_back(u, v);
    }
    void build(){
        E.resize(edge.size());
        for(int i = 0; i < N; i++) start[i + 1] += start[i];
        auto cnt = start;
        for(auto [u, v] : edge) E[cnt[u]++] = v;
    }
    Node operator[](int p) {
        return Node{E.begin() + start[p], E.begin() + start[p + 1]};
    }
};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    constexpr int r = 202500;
    csr<int> divs(r + 1);
    for(int i = 1; i <= r; i++){
        for(int j = i, cur = 1; j <= r; j += i, cur++){
            divs.add_edge(j, cur);
        }
    }
    divs.build();

    csr<pair<int,int>> query(2025);
    int T, n, a;
    cin >> T;
    for(int i = 0; i < T; i++){
        cin >> n >> a;
        query.add_edge(n - 1, {a, i});
    }
    query.build();
    vector<unsigned int> ans(T);
    array<mint, 2026> binom;
    binom[0] = mint::raw(1);
    for(int n = 0; n < 2025; n++){
        for(auto &&[a, idx] : query[n]){
            mint tmp;
            for(auto &&ad : divs[a]){
                int v = ad - n;
                if(v % 2 != 0 || v > 0) continue;
                v = -v / 2;
                if(v <= n) tmp += binom[v];
                v += ad + 1;
                if(v <= n) tmp -= binom[v];
            }
            ans[idx] = tmp.val();
        }
        for(int j = n; j >= 0; j--) binom[j + 1] += binom[j];
    }
    for(auto &&v : ans) cout << v << '\n';
}