#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;

const int NR = 2e5 + 10;
const long long mod = 998244353;
long long fac[NR], power[NR];

long long quick_power(long long a, long long b)
{
	long long base = a, res = 1;
	while (b > 0)
	{
		if (b & 1) res = (res * base) % mod;
		base = (base * base) % mod;
		b >>= 1;
	}
	return res;
}

long long inv(long long x)
{
	return quick_power(x, mod - 2);
}

long long C(long long n, long long m)
{
	if (n < m || n < 0 || m < 0) return 0;
	return fac[n] * inv(fac[n - m]) % mod * inv(fac[m]) % mod;
}

int main()
{
	fac[0] = 1;
	for (int i = 1; i < NR; i ++)
	{
		fac[i] = fac[i - 1] * i % mod;
	}
	power[0] = 1;
	for (int i = 1; i < NR; i ++)
	{
		power[i] = power[i - 1] * 2 % mod;
	}
	int T;
	scanf("%d", &T);
	while (T --)
	{
		int n, m;
		scanf("%d%d", &n, &m);
		long long ans = power[n] - 1;
		ans = (ans % mod + mod) % mod;
		long long sum = 0;
		for (int i = 0; i < m; i ++)
		{
			sum += C(n - 1, i);
			sum %= mod;
		}
		ans = (ans * sum) % mod;
		printf("%lld\n", ans);
	}
	return 0;
}