description: Moamen and Ezzat are playing a game. They create an array a of n non-negative integers where every element is less than 2^k.
  
  Moamen wins if a_1  \&  a_2  \&  a_3  \&  …  \&  a_n ≥ a_1 ⊕ a_2 ⊕ a_3 ⊕ … ⊕ a_n.
  
  Here \& denotes the [bitwise AND operation](https://en.wikipedia.org/wiki/Bitwise_operation#AND), and ⊕ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR).
  
  Please calculate the number of winning for Moamen arrays a.
  
  As the result may be very large, print the value modulo 1 000 000 007 (10^9 + 7).
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 5)— the number of test cases. 
  
  Each test case consists of one line containing two integers n and k (1 ≤ n≤ 2⋅ 10^5, 0 ≤ k ≤ 2⋅ 10^5).
  
  Output
  
  For each test case, print a single value — the number of different arrays that Moamen wins with.
  
  Print the result modulo 1 000 000 007 (10^9 + 7).
  
  Example
  
  Input
  
  
  3
  3 1
  2 1
  4 0
  
  
  Output
  
  
  5
  2
  1
  
  Note
  
  In the first example, n = 3, k = 1. As a result, all the possible arrays are [0,0,0], [0,0,1], [0,1,0], [1,0,0], [1,1,0], [0,1,1], [1,0,1], and [1,1,1].
  
  Moamen wins in only 5 of them: [0,0,0], [1,1,0], [0,1,1], [1,0,1], and [1,1,1].
solution: import sys
  
  readline = sys.stdin.readline
  
  M = 10**9 + 7
  
  def bin_exp(num, k):
      ans = 1
      num %= M
      while k > 0:
          if k % 2 == 1:
              ans *= num
              ans %= M
          num *= num
          num %= M
          k //= 2
      return ans
  
  t = int(readline())
  for _ in range(t):
      n, k = map(int, readline().split())
      if k == 0:
          print(1)
          continue
      two_n_1 = bin_exp(2, n-1)
      if n%2 == 1:
          two_n_1 = (two_n_1 + 1) % M
          print(bin_exp(two_n_1, k) % M)
      else:
          dp = [0]* k
          dp[0] = two_n_1
          two_n = (2* two_n_1) % M
          two_n_1 -= 1
          if two_n_1 < 0: 
              two_n_1 += M
          two_n_k = 1
          for i in range(1, k):
              dp[i] = (dp[i-1] * two_n_1) % M
              two_n_k *= two_n
              two_n_k %= M
              dp[i] += two_n_k
              dp[i] %= M
          print(dp[k-1] % M)