#include <bits/stdc++.h>
using namespace std;
const int N=2e5+10,mod=998244353;
int n,m,bin[N];
int fac[N],inv[N],invp[N];
int qpow(int bas,int ind)
{
	int prd=1;
	for (;ind;ind>>=1)
	{
		if (ind&1) prd=1ll*prd*bas%mod;
		bas=1ll*bas*bas%mod;
	}
	return prd;
}
int C(int x,int y)
{
	if (y<0||x>y) return 0;
	return 1ll*fac[y]*invp[x]%mod*invp[y-x]%mod;
}
void solve()
{
	scanf("%d%d",&n,&m);
	int a=0,b=(bin[n]+mod-1)%mod;
	for (int i=0;i<m;i++) (a+=C(i,n-1))%=mod;
	printf("%lld\n",1ll*a*b%mod);
}
int main()
{
	n=2e5;
	bin[0]=1;
	for (int i=1;i<=n;i++) bin[i]=2*bin[i-1]%mod;
	fac[0]=inv[0]=invp[0]=1;
	fac[1]=inv[1]=invp[1]=1;
	for (int i=2;i<=n;i++)
		fac[i]=1ll*fac[i-1]*i%mod,
		inv[i]=1ll*(mod-mod/i)*inv[mod%i]%mod,
		invp[i]=1ll*invp[i-1]*inv[i]%mod;
	int TT;
	cin>>TT;
	while (TT--) solve();
	return 0;
}