#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 ifact[MAX];
ll fact[MAX];
void solve() {
	ll N, K;
	cin >> N >> K;
	if (K == 0) {
		cout << 1 << '\n';
		return;
	}
	ll i;
	ll ans = 0;
	vector<ll> v;
	ll sol = (N + 1) * (N + 1) - 4 * K;
	if (sol < 0) {
		cout << 0 << '\n';
		return;
	}
	sol = sqrt(sol);
	sol = N + 1 - sol;
	sol >>= 2;
	for (i = max(1ll, sol - 20); i <= min(K, sol + 20); i++) {
		if (K % i == 0) {
			v.push_back(i);
			if (K / i != i) v.push_back(K / i);
		}
	}
	sort(v.begin(), v.end());
	v.erase(unique(v.begin(), v.end()), v.end());
	for (auto i : v) {
		ll e = i;
		ll o = K / i;
		if (o + e != N + 1) continue;
		e--;
		ll res = fact[N];
		res = (res * ifact[e]);
		res %= MOD;
		res = (res * ifact[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;
	int X = 100'010;
	for (i = 1; i <= 100'100; i++) fact[i] = (fact[i - 1] * i) % MOD;
	ifact[X] = mpow(fact[X]);
	for (i = X; i >= 1; i--) ifact[i - 1] = (ifact[i] * i) % MOD;
	while (T--) solve();
}