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: t=int(input())
  pow2=[1 for x in range(2*100000+1)]
  mod=10**9+7
  for i in range(1,200000+1):
      pow2[i]=pow2[i-1]*2
      pow2[i]%=mod
  def solve(k,n):
      if k==0:
          return 1
      if dp[k]!=-1:
          return dp[k]
  
      if n%2==0:
          ans=pow22[k-1]-solve(k-1,n)
          ans+=solve(k-1,n)*pow2[n-1]
          ans%=mod
      else:
          ans=solve(k-1,n)
          ans+=solve(k-1,n)*pow2[n-1]
          ans%=mod
      dp[k]=ans
      return ans
  
  while t:
      t-=1
      n,k=[int(x) for x in input().split()]
      pow22=[1 for x in range(k+1)]
      for i in range(1,k+1):
          pow22[i]=pow22[i-1]*pow2[n]
          pow22[i]%=mod
      if k==0:
          print(1)
          continue
      dp=[-1 for x in range(k+1)]
      for i in range(1,k):
          solve(i,n)
      print(solve(k,n))