#include <bits/stdc++.h>
using namespace std;
using db = double;
using ll = long long;
using ull = uint64_t;
using u16 = uint16_t;
using u32 = uint32_t;
using ldb = long double;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using puu = pair<ull, ull>;
#define fi first
#define se second
#define ep emplace
#define mp make_pair
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define ffor(x, l, r) for (int x = (l); x <= (r); x++)
#define rfor(x, r, l) for (int x = (r); x >= (l); x--)
#define int long long
typedef array<int, 3> ar3;
random_device rd;
mt19937 rng(rd());
constexpr int N = 2e5 + 100;
constexpr int mod = 998244353;
ll fac[N], ifac[N];
ll qpow(ll a, ll b) {
  ll res = 1;
  while (b) {
    if (b & 1) res = res * a % mod;
    b >>= 1, a = a * a % mod;
  }
  return res;
}
void init(int n) {
  fac[0] = 1;
  ffor(i, 1, n) fac[i] = fac[i - 1] * i % mod;
  ifac[n] = qpow(fac[n], mod - 2);
  rfor(i, n - 1, 0) ifac[i] = ifac[i + 1] * (i + 1) % mod;
}
ll C(ll n, ll m) {
  if (n < m)
    return 0;
  else
    return fac[n] * ifac[n - m] % mod * ifac[m] % mod;
}
void clear() {
}
void solve() {
  ll n, m;
  cin >> n >> m;
  ll val = 1, ans = 0, num = 0;
  ffor(i, 0, m - 1) num = (num + C(n - 1, i)) % mod;
  ffor(i, 0, n - 1) {
    ans = (ans + num * val % mod) % mod;
    val = val * 2 % mod;
  }
  cout << ans << '\n';
}
signed main() {
  init(2e5);
  cin.tie(0)->sync_with_stdio(0);
  int T;
  cin >> T;
  while (T--) clear(), solve();
  return 0;
}