from sys import stdin
input = stdin.readline

class Eratosthenes:
    def __init__(self, n):
        self.isPrime = [True]*(n+1)
        self.minfactor = [-1]*(n+1)
        self.isPrime[0], self.isPrime[1] = False, False
        self.minfactor[1] = 1
        for i in range(2, n+1):
            if self.isPrime[i]:
                self.minfactor[i] = i
                for j in range(i*2, n+1, i):
                    self.isPrime[j] = False
                    if self.minfactor[j] == -1:
                        self.minfactor[j] = i
    
    def factorize(self, n):
        factor = []
        while n > 1:
            p = self.minfactor[n]
            cnt = 0
            while self.minfactor[n] == p:
                n //= p
                cnt += 1
            factor.append((p, cnt))
        return factor
    
    def divisor(self, n):
        ans = [1]
        pf = self.factorize(n)
        for p, c in pf:
            L = len(ans)
            for i in range(L):
                v = 1
                for _ in range(c):
                    v *= p
                    ans.append(ans[i]*v)
        return ans

MOD = 998244353
E = Eratosthenes(202500)

L = 2025
dp = [[0]*(L+1) for _ in range(L+1)]
dp[0][0] = 1
for i in range(L):
    for j in range(L+1):
        if dp[i][j] == 0:
            continue
        if j < L:
            dp[i+1][j+1] += dp[i][j]
            dp[i+1][j+1] %= MOD
        if 1 <= j:
            dp[i+1][j-1] += dp[i][j]
            dp[i+1][j-1] %= MOD

for _ in range(int(input())):
    N, A = map(int, input().split())

    div = E.divisor(A)
    ans = 0
    for d in div:
        cnt = A//d
        if cnt <= N-1 and (N-1-cnt)%2 == 0:
            ans += dp[N-1][cnt]
            ans %= MOD
    
    print(ans)