#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
using namespace std;
//#define N (1000000000+7)
#define N (998244353)
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;

ll inv(ll x,ll power) {
	ll res = 1;
	ll k = power;
	ll y = x%N;
	while (k) {
		if (k & 1)res = (res*y) % N;
		y = (y%N*y%N) % N;
		k /= 2;
	}
	return res;
}


int main(void){
    ll T;
    cin>>T;
    while(T--){
        ll n,k;
        cin>>n>>k;
        ll t = inv(2LL,k);
        ll ans = ((t-1)*n)%N;
        ans = (ans*inv(t,n-1))%N;
        ans = (ans+N)%N;
        cout<<ans<<endl;
    }
}