#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2000010, B = 2000000;
const ll mod = 998244353;
ll qpow (ll a, int b) {
	ll ans = 1;
	while (b) {
		if (b & 1) ans = ans * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return ans;
}
ll fac[N], ifac[N];
int T, n, k;
ll g (int n, int m) {
	if ((n + m) & 1) {
		int b = (m - n + 1) / 2;
		ll tmp = 1;
		tmp = fac[n + b - 1] * fac[n + 2 * b] % mod;
		tmp = tmp * ifac[b] % mod * ifac[2 * n + 2 * b - 2] % mod;
		return tmp;
	} else {
		int b = (m - n) / 2;
		ll tmp = 1;
		tmp = 2 * fac[n + b] % mod * fac[n + 2 * b] % mod;
		tmp = tmp * ifac[b] % mod * ifac[2 * n + 2 * b - 1] % mod;
		return tmp;
	}
}
int main () {
	cin >> T;
	fac[0] = 1; for (int i=1;i<=B;i++) fac[i] = fac[i - 1] * i % mod;
	ifac[B] = qpow (fac[B], mod - 2);
	for (int i=B-1;i>=0;i--) ifac[i] = ifac[i + 1] * (i + 1) % mod; 
	while (T --) {
		cin >> n >> k;
		ll Ans = 0;
		for (int m=n-1;m<=k;m++) {
			Ans = (Ans + g (n, m)) % mod;
		}
		if (n == 1) {
			Ans = 0;
			for (int m=1;m<=k;m++) Ans += m + 1, Ans %= mod;
		}
		cout << Ans << endl;
	}
}