## https://yukicoder.me/problems/no/3403 MOD = 998244353 class CombinationCalculator: """ modを考慮したPermutation, Combinationを計算するためのクラス """ def __init__(self, size, mod): self.mod = mod self.factorial = [0] * (size + 1) self.factorial[0] = 1 for i in range(1, size + 1): self.factorial[i] = (i * self.factorial[i - 1]) % self.mod self.inv_factorial = [0] * (size + 1) self.inv_factorial[size] = pow(self.factorial[size], self.mod - 2, self.mod) for i in reversed(range(size)): self.inv_factorial[i] = ((i + 1) * self.inv_factorial[i + 1]) % self.mod def calc_combination(self, n, r): if n < 0 or n < r or r < 0: return 0 if r == 0 or n == r: return 1 ans = self.inv_factorial[n - r] * self.inv_factorial[r] ans %= self.mod ans *= self.factorial[n] ans %= self.mod return ans def calc_permutation(self, n, r): if n < 0 or n < r: return 0 ans = self.inv_factorial[n - r] ans *= self.factorial[n] ans %= self.mod return ans def main(): T = int(input()) questions = [] max_a = 0 for _ in range(T): N, A = map(int, input().split()) questions.append((N , A)) max_a = max(max_a, A) # 約数列挙 divisors_list = [[] for _ in range(max_a + 1)] for d in range(1, max_a + 1): x = d while x <= max_a: divisors_list[x].append(d) x += d # 本計算 combi = CombinationCalculator(N, MOD) for N, A in questions: ans = 0 for d in divisors_list[A]: q = A // d if (N - 1) - q >= 0 and ((N - 1) - q) % 2 == 0: x = ((N - 1) - q) // 2 y = (combi.calc_combination(N - 1, x) - combi.calc_combination(N - 1, x - 1)) % MOD ans += y ans %= MOD print(ans) if __name__ == "__main__": main()