def divisors(n: int) -> list[int]:
    """n の約数を求める"""
    s = set()
    p = 1
    while p * p <= n:
        if n % p == 0:
            s.add(p)
            s.add(n // p)
        p += 1
    return sorted(s)


class ModComb:
    def __init__(self, n: int, mod: int):
        fact = [0] * (n+1)
        fact[0] = 1
        for i in range(1, n+1):
            fact[i] = i * fact[i-1] % mod

        ifact = [0] * (n+1)
        ifact[n] = pow(fact[n], mod-2, mod)
        for i in range(n, 0, -1):
            ifact[i-1] = ifact[i] * i % mod
        self.fact = fact
        self.ifact = ifact
        self.mod = mod

    def __call__(self, n: int, k: int) -> int:
        if n < 0 or k > n: return 0
        return (self.fact[n] * self.ifact[k] % self.mod) * self.ifact[n-k] % self.mod


def solve():
    N, A = map(int, input().split())

    res = 0
    for d in divisors(A):
        m = A // d
        if m > N-1: continue
        if (N-1-m) % 2 != 0: continue

        up = (N-1 + m) // 2
        bad_k = up - 1 - m
        tot = mcomb(N-1, up)
        bad = mcomb(N-1, bad_k) if bad_k >= 0 else 0

        res += tot - bad
        res %= MOD

    return res


MOD = 998244353
T = int(input())

mcomb = ModComb(202500, MOD)
for _ in range(T):
    ans = solve()
    print(ans)