//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll mod=998244353;
ll ksm(ll a,ll b)
{
	ll ans=1;
	while(b)
	{
		if(b&1) ans=ans*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return ans;
}
ll fact[2002000],rfact[2002000];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	fact[0]=1;
	for(int i=1;i<2002000;i++)
		fact[i]=fact[i-1]*i%mod;
	for(int i=0;i<2002000;i++)
		rfact[i]=ksm(fact[i],mod-2);
	int t;
	cin>>t;
	while(t--)
	{
		int n,k;
		cin>>n>>k;
		ll ans=0;
		for(int b=0;b+b<=k-n;b++)
			ans=(ans+2*fact[n+b]*fact[n+b+b]%mod*rfact[b]%mod*rfact[n+n+b+b-1])%mod;
		for(int b=(n==1?1:0);b+b-1<=k-n;b++)
			ans=(ans+fact[n+b-1]*fact[n+b+b]%mod*rfact[b]%mod*rfact[n+n+b+b-2])%mod;
		cout<<ans<<'\n';
	}
	return 0;
}