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: mod = 10**9 + 7
  
  def odd(k):
      if k==0:
          return 1
      else:
          oddd = [1 for _ in range(k+1)]
          for a in range(k, 0, -1):
              if a==k:
                  oddd[a] = (tno+1)%mod
              else:
                  oddd[a] = ((tno+1)*oddd[a+1])%mod
          return oddd[1]
  
  def even(k):
      if k==0:
          return 1
      else:
          eveen = [1 for _ in range(k+1)]
          for a in range(k, 0, -1):
              if a==k:
                  eveen[a] = tno
              else:
                  eveen[a] = (tro[a]+(tno-1)*eveen[a+1])%mod
          return eveen[1]
  
  for _ in range(int(input())):
      n, k = map(int, input().split())
      tno = 2**(n-1)%mod
      tnt = 2*tno%mod
      tro = [0 for _ in range(k+1)]
      pip = 1
      for a in range(k, 0, -1):
          tro[a] = pip
          pip = pip*tnt%mod
      if n%2!=0:
          print(odd(k))
      else:
          print(even(k))