#include<iostream>
#include<cassert>
#include<atcoder/modint>
using namespace std;
#include<vector>
template<typename T>
struct combination{
	vector<T>fac,ifac;
	combination(size_t N=0):fac(1,1),ifac(1,1)
	{
		make_table(N);
	}
	void make_table(size_t N)
	{
		if(fac.size()>N)return;
		size_t now=fac.size();
		N=max(N,now*2);
		fac.resize(N+1);
		ifac.resize(N+1);
		for(size_t i=now;i<=N;i++)fac[i]=fac[i-1]*i;
		ifac[N]=1/fac[N];
		for(size_t i=N;i-->now;)ifac[i]=ifac[i+1]*(i+1);
	}
	T factorial(size_t n)
	{
		make_table(n);
		return fac[n];
	}
	T invfac(size_t n)
	{
		make_table(n);
		return ifac[n];
	}
	T P(size_t n,size_t k)
	{
		if(n<k)return 0;
		make_table(n);
		return fac[n]*ifac[n-k];
	}
	T C(size_t n,size_t k)
	{
		if(n<k)return 0;
		make_table(n);
		return fac[n]*ifac[n-k]*ifac[k];
	}
	T H(size_t n,size_t k)
	{
		if(n==0)return k==0?1:0;
		return C(n-1+k,k);
	}
};
using mint=atcoder::modint998244353;
combination<mint>C;
mint ans[2<<17];
int N[2<<17],M[2<<17];
vector<int>Qi[2<<17];
mint tmp[2<<17];
mint solve(int n,int m)
{
	mint ret=0;
	for(int i=0;i<m;i++)ret+=C.C(2*i,n-1);
	return ret;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int T;cin>>T;
	for(int i=0;i<T;i++)
	{
		cin>>N[i]>>M[i];
		Qi[N[i]].push_back(i);
	}
	const int B=1000;
	for(int m=0;m<=200000;m+=B)tmp[m]=mint::raw(m);
	const mint inv2=mint::raw(2).inv();
	for(int n=1;n<=200000;n++)
	{
		for(int qi:Qi[n])
		{
			int m=M[qi];
			int qm=m/B;
			mint now=tmp[qm*B];
			for(int i=qm*B;i<m;i++)now+=C.C(2*i,n-1);
			ans[qi]=now;
		}
		for(int m=0;m<=200000;m+=B)tmp[m]=(C.C(2*m,n+1)-tmp[m])*inv2;
	}
	for(int i=0;i<T;i++)cout<<ans[i].val()<<"\n";
}