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 java.io.*;
  import java.util.*;
  
  public class n737C {
  
      static long mod = (long)Math.pow(10, 9) + 7;
  
      public static void main(String[] args) {
          FastScanner sc = new FastScanner();
          int t = sc.ni();
          while (t-- > 0) {
              int n = sc.ni();
              int k = sc.ni();
              long v1 = 1;
              for (int i = 0; i < n - 1; i++) {
                  v1 = (v1 * 2) % mod;
              }
              long v2 = (v1 * 2) % mod;
  //            System.out.println(v1);
  //            System.out.println(v2);
  
              if (k == 0) {
                  System.out.println(1);
              } else {
                  long[][] dp = new long[k + 1][2];
                  dp[1][0] = (1 + v1 - (n + 1) % 2) % mod;
                  dp[1][1] = v2 % mod;
                  if (n % 2 == 0) {
                      for (int i = 2; i <= k; i++) {
                          dp[i][0] = (dp[i - 1][1] + (v1 - 1) * dp[i - 1][0]) % mod;
                          dp[i][1] = (dp[i - 1][1] * v2) % mod;
                      }
                  } else {
                      for (int i = 2; i <= k; i++) {
                          dp[i][0] = ((1 + v1) * dp[i - 1][0]) % mod;
                          dp[i][1] = (dp[i - 1][1] * v2) % mod;
                      }
                  }
                  System.out.println(dp[k][0]);
              }
          }
      }
  
  
      static class FastScanner {
          BufferedReader br;
          StringTokenizer st;
  
          public FastScanner() {
              br = new BufferedReader(new InputStreamReader(System.in), 32768);
              st = null;
          }
  
          String next() {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
  
          int ni() {
              return Integer.parseInt(next());
          }
  
          int[][] graph(int N, int[][] edges) {
              int[][] graph = new int[N][];
              int[] sz = new int[N];
              for (int[] e : edges) {
                  sz[e[0]] += 1;
                  sz[e[1]] += 1;
              }
              for (int i = 0; i < N; i++) {
                  graph[i] = new int[sz[i]];
              }
              int[] cur = new int[N];
              for (int[] e : edges) {
                  graph[e[0]][cur[e[0]]] = e[1];
                  graph[e[1]][cur[e[1]]] = e[0];
                  cur[e[0]] += 1;
                  cur[e[1]] += 1;
              }
              return graph;
          }
  
          int[] intArray(int N, int mod) {
              int[] ret = new int[N];
              for (int i = 0; i < N; i++)
                  ret[i] = ni() + mod;
              return ret;
          }
  
          long nl() {
              return Long.parseLong(next());
          }
  
          long[] longArray(int N, long mod) {
              long[] ret = new long[N];
              for (int i = 0; i < N; i++)
                  ret[i] = nl() + mod;
              return ret;
          }
  
          double nd() {
              return Double.parseDouble(next());
          }
  
          String nextLine() {
              String str = "";
              try {
                  str = br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
  
  }
  