def combs_mod(n,k,mod):
  #nC0からnCkまで
  inv = [1]*(k+1)
  for i in range(1,k+1):
    inv[i] = pow(i,mod-2,mod)
  ans = [1]*(k+1)
  for i in range(1,k+1):
    ans[i] = ans[i-1]*(n+1-i)*inv[i]%mod
  return ans
def solve():
  mod = 998244353
  T = int(input())
  ans = [0]*T
  for i in range(T):
    N,K = map(int, input().split())
    X = pow(2,K,mod)
    ans[i] = N*pow(X,N-1,mod)*(X-1)%mod
  return ans
print(*solve(), sep='\n')