#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5+5, mod = 998244353;
int n, m, fac[N], inv[N], inv2[N];
int qpow(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res *= a, res %= mod;
		a *= a;
		a %= mod;
		b >>= 1;
	}
	return res;
}
void Init() {
	fac[0] = inv[0] = 1;
	for (int i = 1; i <= N - 5; i++) fac[i] = fac[i - 1] * i % mod;
	inv[N - 5] = qpow(fac[N - 5], mod - 2);
	for (int i = N - 5; i >= 1; i--) inv[i - 1] = inv[i] * i % mod;
}
int C(int n, int m) {
	if (m == 0) return 1;
	return fac[n] * inv[m] % mod*inv[n - m] % mod;
}
void solve() {
	cin >> n >> m;
	int ans = 0;
	for (int i = 0; i <= m - 1; i++) {
		ans += C(n - 1, i);
		ans %= mod;
	}
	cout << ans*(qpow(2, n) - 1) % mod << "\n";
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	Init();
	int T;
	cin >> T;
	while (T--) solve();
	return 0;
}