#include<bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
const int N=2e5+5,mod=998244353,inv2=(mod+1)/2;
int read(){
	int x=0;char c=getchar();
	while(c<'0'||c>'9')  c=getchar();
	while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}
	return x;
}
int fac[N],ifac[N];
int qpow(int a,int b){
	int res=1;
	while(b){
		if(b&1)  res=1ll*res*a%mod;
		a=1ll*a*a%mod;b>>=1;
	}
	return res;
}
struct node{int x,y,id;}qry[N];
int q,siz,ans[N];
bool cmp(node a,node b){
	return a.x/siz!=b.x/siz?a.x<b.x:a.y<b.y;
}
int c(int n,int m){
	if(n<m||m<0||n<0) return 0;
	return 1ll*fac[n]*ifac[m]%mod*ifac[n-m]%mod;
}
signed main(){
	q=read();siz=sqrt(200000);
	fac[0]=1;
	for(int i=1;i<N;i++) fac[i]=1ll*fac[i-1]*i%mod;
	ifac[N-1]=qpow(fac[N-1],mod-2);
	for(int i=N-2;i>=0;i--) ifac[i]=1ll*ifac[i+1]*(i+1)%mod;
	for(int i=1;i<=q;i++){
		qry[i].x=read();qry[i].y=read();
		--qry[i].x;--qry[i].y;qry[i].id=i;
	}
	sort(qry+1,qry+q+1,cmp);
	for(int i=1,x=0,y=0,res=1;i<=q;i++){
		int qx=qry[i].x,qy=qry[i].y;
		while(x<qx){
			res=(2ll*res%mod-c(x,y)+mod)%mod;
			++x;
		}
		while(x>qx){
			--x;
			res=(1ll*inv2*(res+c(x,y)))%mod;
		}
		while(y<qy){
			++y;
			res=(res+c(x,y))%mod;
		}
		while(y>qy){
			res=(res-c(x,y)+mod)%mod;
			--y;
		}
		ans[qry[i].id]=1ll*res*(qpow(2,qx+1)-1)%mod;
	}
	for(int i=1;i<=q;i++)  printf("%d\n",ans[i]);
	return 0;
}