#include <bits/stdc++.h>
using namespace std;
const int N=200010,M=998244353,B=400,S=200000/B+1;
int T,n,m,fac[N],inv[N],pw[N],csum[S][N];
int comb(int sum1,int sum2){
	if(sum1<sum2) return 0;
	return 1ll*fac[sum1]*inv[sum2]%M*inv[sum1-sum2]%M;
}
int solve(int sum1,int sum2){
	int res=0,mul=1;
	while(true){
		if(sum2<0||sum1<sum2) break;
		if(sum1%B==0){ (res+=1ll*csum[sum1/B][sum2]*mul%M)%=M; break; }
		(res+=1ll*mul*comb(sum1-1,sum2)%M)%=M,(mul*=2)%=M,sum1--,sum2--;
	}
	return res;
}
void work(){
	scanf("%d%d",&n,&m);
	printf("%d\n",1ll*(pw[n]-1+M)%M*solve(n-1,m-1)%M);
}
int main(){
	fac[0]=fac[1]=inv[0]=inv[1]=pw[0]=1,pw[1]=2;
	for(int i=2;i<=200000;i++){
		pw[i]=1ll*pw[i-1]*2%M;
		fac[i]=1ll*fac[i-1]*i%M;
		inv[i]=1ll*inv[M%i]*(M-M/i)%M;
	}
	for(int i=2;i<=200000;i++)
		inv[i]=1ll*inv[i-1]*inv[i]%M;
	for(int i=0;i<=200000/B;i++)
		for(int j=0;j<=i*B;j++)
			csum[i][j]=(csum[i][j-1]+comb(i*B,j))%M;
	for(scanf("%d",&T);T;T--) work();
}