#include<bits/stdc++.h>
#define irep(i,l,r) for(int i = l; i <= r; ++i)
#define drep(i,r,l) for(int i = r; i >= l; --i)
#define ceil(pp,qq) (((pp)>0)^((qq)>0)?-Abs(pp)/Abs(qq):(pp)%(qq)?(pp)/(qq)+1:(pp)/(qq))
#define floor(pp,qq) (((pp)>0)^((qq)>0)?-ceil(abs(pp),abs(qq)):(pp)/(qq))
#define ll long long
using namespace std;
ll Abs(ll x){return x > 0 ? x : - x;}
inline ll read(){
	char ch = getchar();
	ll s = 0; bool w = 0;
	while(!isdigit(ch)){if(ch == '-')w = 1;ch = getchar();}
	while(isdigit(ch))s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
	return w ? - s : s;
}

const int itinf = 2e9;
const ll llinf = 4e18;
const ll mod = 998244353;
const int N = 500009;

inline ll mmul ( ll a, ll b, const ll& Mod )  {
	ll lf = a * ( b >> 25LL ) % Mod * ( 1LL << 25 ) % Mod ;
    ll rg = a * ( b & ( ( 1LL << 25 ) - 1 ) ) % Mod ;
	return ( lf + rg ) % Mod ;
}

ll qpow(ll base, ll b){
	ll ans = 1;
	while(b){
		if(b & 1)ans = mmul(ans, base, mod);
		base = mmul(base, base, mod), b >>= 1;
	}
	return ans;
}

int main(){
	ll T = read();
	while(T --){
		ll n = read() % mod, m = read() % mod;
		printf("%lld\n",(n - (1 + (n - 1) * qpow
		((1 - 2 * qpow(n, mod - 2) % mod) + mod, m)
		) % mod + mod) % mod);
	}
	return 0;
}