#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
using namespace std;

const int maxn = 2e5 + 5;
const int mod = 998244353;
int n, ifac[maxn], fac[maxn], pw[maxn], m;

void Add(int &x, int y){((x += y) >= mod) && (x -= mod);}

int qpow(int x, int y){int sum = 1; for(; y; y >>= 1, x = 1ll * x * x % mod) if(y & 1) sum = 1ll * sum * x % mod; return sum;}
void init(){
    int N = 2e5;
    fac[0] = 1; for(int i = 1; i <= N; i++) fac[i] = 1ll * fac[i - 1] * i % mod;
    ifac[N] = qpow(fac[N], mod - 2); for(int i = N; i; i --) ifac[i - 1] = 1ll * ifac[i] * i % mod;
    pw[0] = 1; for(int i = 1; i <= N; i++) pw[i] = 2ll * pw[i - 1] % mod;
}

int C(int x, int y){return x < 0 || y < 0 || x < y ? 0 : 1ll * fac[x] * ifac[y] % mod * ifac[x - y] % mod;}

void solve(){
    cin >> n >> m;
    int ans = 0, sum = 0;
    for(int i = 0; i <= m - 1; i++) Add(sum, C(n - 1, i));
    for(int i = 0; i < n; i++){
        Add(ans, 1ll * pw[i] * sum % mod);
    }
    cout << ans << '\n';
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    init();
    int t; cin >> t; while(t--) solve();

    return 0;
}