#include<bits/stdc++.h>
#define int long long
#define mod 998244353
using namespace std;
int t,fac[200005],inv[200005],wop[200005],inv2,ans[200005],blk;
struct node{
	int n,m,id;
}q[200005];
int qpow(int a,int b){
	int r=1;
	while(b){
		if(b&1) r=r*a%mod;
		a=a*a%mod,b>>=1;
	}
	return r;
}
int caxy(int n,int m){
	if(m<0||m>n) return 0;
	return fac[n]*inv[m]%mod*inv[n-m]%mod;
}
bool cmp(node a,node b){
	int ba=a.n/blk,bb=b.n/blk;
	if(ba!=bb) return ba<bb;
	return (ba&1)?a.m>b.m:a.m<b.m;
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	fac[0]=1;
	for(int i=1;i<200005;i++) fac[i]=fac[i-1]*i%mod;
	inv[200004]=qpow(fac[200004],mod-2);
	for(int i=200003;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;
	wop[0]=1;
	for(int i=1;i<200005;i++) wop[i]=(wop[i-1]<<1)%mod;
	inv2=(mod+1)>>1;cin>>t;
	for(int i=1;i<=t;i++){
		int n,m;cin>>n>>m;
		q[i]={n-1,m-1,i};
	}
	blk=max((int)1,(int)(200000/sqrt(t)));
	sort(q+1,q+t+1,cmp);
	int n=0,m=0,now=1;
	for(int i=1;i<=t;i++){
		int qn=q[i].n,qm=q[i].m;
		while(n<qn) now=((now<<1)-caxy(n,m)+mod)%mod,n++;
		while(n>qn){
			n--;
			now=(now+caxy(n,m))%mod;
			now=now*inv2%mod;
		}
		while(m<qm) m++,now=(now+caxy(n,m))%mod;
		while(m>qm) now=(now-caxy(n,m)+mod)%mod,m--;
		ans[q[i].id]=(wop[q[i].n+1]-1+mod)%mod*now%mod;
	}
	for(int i=1;i<=t;i++) cout<<ans[i]<<"\n";
	return 0;
}