#include <bits/stdc++.h>
#define int long long int
using namespace std;

const int MAXN = 2e5 + 5, mod = 998244353;
int n, m, jc[MAXN], inv[MAXN];

int KSM(int a, int b) {
	int sum = 1;
	while (b) {
		if (b & 1) sum *= a, sum %= mod;
		a *= a, a %= mod;
		b >>= 1;
	}
	return sum;
}

int C(int a, int b) {
	return jc[a] * inv[b] % mod * inv[a - b] % mod;
}

void solve() {
	cin >> n >> m;
	int ans = 0;
	for (int i = 1; i <= m; i++) ans += C(n - 1, i - 1), ans %= mod;
	cout << (-1 * ans + ans * KSM(2, n) % mod + mod) % mod << '\n';
}

signed main() {
	ios::sync_with_stdio(false); cin.tie(0);
	jc[1] = inv[1] = inv[0] = jc[0] = 1;
	for (int i = 2; i <= MAXN - 5; i++) jc[i] = jc[i - 1] * i % mod, inv[i] = (mod - mod / i) * inv[mod % i] % mod;
	int sum = 1; inv[1] = 1;
	for (int i = 2; i <= MAXN - 5; i++) sum *= inv[i], sum %= mod, inv[i] = sum % mod;
	int T; cin >> T; while (T--) solve();
	return 0;
}
/*
0 1 2 3 4 5
*/