#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define MOD 998244353
#define MAX 202020
ll mpow(ll x, ll y = MOD - 2) {
	ll mul = x;
	ll ans = 1;
	while (y) {
		if (y & 1) ans = (ans * mul) % MOD;
		y >>= 1;
		mul = (mul * mul) % MOD;
	}
	return ans;
}
ll fact[MAX];
void solve() {
	ll N, K;
	cin >> N >> K;
	if (K == 0) {
		cout << 1 << '\n';
		return;
	}
	ll i;
	ll ans = 0;
	for (i = 1; i <= K; i++) {
		if (K % i == 0) {
			ll e = i;
			ll o = K / i;
			if (o + e != N + 1) continue;
			e--;
			ll res = fact[N];
			res = (res * mpow(fact[e]));
			res %= MOD;
			res = (res * mpow(fact[N - e]));
			res %= MOD;
			ans += res;
			ans %= MOD;
		}
	}
	cout << ans << '\n';
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int T;
	cin >> T;
	int i;
	fact[0] = 1;
	for (i = 1; i <= 100'100; i++) fact[i] = (fact[i - 1] * i) % MOD;
	while (T--) solve();
}