#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lll __int128
#define db double
#define ld long double
#define eps 1e-8
#define fir first
#define sec second
#define pb push_back
#define ppc __builtin_popcount
using namespace std;
void rd(){}
template<typename T,typename... U> void rd(T &x,U&... arg){
	x=0;int f=1,c=getchar();
	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=x*10+c-48,c=getchar();
	x*=f;rd(arg...);
}

const int maxn=2e5+5,P=998244353;
template<typename T> inline void inc(T &x,T y){(x+=y)>=P?(x-=P):0;}
template<typename T> inline T mod(T n){return n>=P?n-P:n;}
inline ll fpow(ll n,ll x){ll s=1;while(x){if(x&1) s=s*n%P;x>>=1,n=n*n%P;}return s;}

ll fac[maxn],inv[maxn];
inline ll C(int n,int m){
	if(n==m) return 1;
	if(n<m||m<0) return 0;
	return fac[n]*inv[m]%P*inv[n-m]%P;
}

int N,M;

void __main(){
	rd(N,M);
	ll sum=0;
	for(int i=0;i<M;i++){
		inc(sum,C(N-1,i));
	}
	ll ans=0;
	for(int i=0,pw=1;i<N;i++,pw=mod(pw*2)){
		inc(ans,pw*sum%P);
	}
	printf("%lld\n",ans);
}

int main(){
	fac[0]=1;
	for(int i=1;i<maxn;i++) fac[i]=fac[i-1]*i%P;
	inv[maxn-1]=fpow(fac[maxn-1],P-2);
	for(int i=maxn-2;~i;i--) inv[i]=inv[i+1]*(i+1)%P;

	int T;rd(T);
	while(T--) __main();
	return 0;
}