#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)n;i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

const ll MOD = 998244353;

long long mod_pow(long long n, long long p, long long m) {
    if (p == 0) return 1;
    if (p % 2 == 0) {
        long long t = mod_pow(n, p / 2, m);
        return (t * t) % m;
    }
    return n * mod_pow(n, p - 1, m) % m;
}

void solve() {
    ll n, k;
    cin >> n >> k;
    ll res1 = mod_pow(mod_pow(2, n, MOD), k, MOD);
    ll res2 = mod_pow(mod_pow(2, n - 1, MOD), k, MOD);
    ll res = (res1 - res2) % MOD;
    if (res < 0) res += MOD;
    cout << res * n % MOD << endl;
}
int main() {
    int t;
    cin >> t;
    rep(i, t) {
        solve();
    }
    return 0;
}