#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define mod 998244353
ll t,jc[3000030],jcinv[3000030];
ll g(ll n,ll m){
	if(n%2==m%2){
		ll b=(m-n)>>1,res=2;
		res=res*jc[n+b]%mod;
		res=res*jc[n+2*b]%mod;
		res=res*jcinv[b]%mod;
		res=res*jcinv[2*n+2*b-1]%mod;
		return res;
	}
	else{
		ll b=(m-n+1)>>1,res=1;
		res=res*jc[n+b-1]%mod;
		res=res*jc[n+2*b]%mod;
		res=res*jcinv[b]%mod;
		res=res*jcinv[2*n+2*b-2]%mod;
		return res;
	}
}
void init(){
	jc[0]=1;
	fr(i,1,3000000) jc[i]=jc[i-1]*i%mod;
	jcinv[3000000]=inv(jc[3000000],mod);
	pfr(i,2999999,0) jcinv[i]=jcinv[i+1]*(i+1)%mod;
}
int main(){
	init();
	t=read();
	while(t--){
		ll n=read(),k=read(),ans=0;
		if(n==1){
			ans=(k+1)*(k+2)/2-1;
			writeln(ans%mod);
			continue;
		}
		fr(m,n-1,k) ans=(ans+g(n,m))%mod;
		writeln(ans);
	}
}