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 Main {
      
      public static void main(String[] args) throws IOException {
          Scanner scn = new Scanner(System.in);
          OutputWriter out = new OutputWriter(System.out);
          // Always print a trailing "\n" and close the OutputWriter as shown at the end of your output
          
          // example:
          int[] pow=new int[200001];
          pow[0]=1;
          int p=1000000007;
          for(int i=1;i<=200000;i++){
              pow[i]=(pow[i-1]*2)%p;
          }
          int t = scn.nextInt();
          for(int i1=0;i1<t;i1++){
              int n=scn.nextInt();
              int k=scn.nextInt();
              if(n%2==1){
                  long ans=1;
                  for(int i=1;i<=k;i++){
                      ans=(ans*(pow[n-1]+1))%p;
                  }
                  out.print(ans+"\n");
              }
              else{
                  long[] a=new long[k+1];a[0]=1;
                  long[] b=new long[k+1];b[0]=1;
                  for(int i=1;i<=k;i++){
                      a[i]=(a[i-1]*(pow[n-1]-1))%p;
                      b[i]=(b[i-1]*pow[n])%p;
                  }
                  long ans=a[k];
                  for(int i=1;i<=k;i++){
                      ans+=(a[i-1]*b[k-i])%p;ans=ans%p;
                  }
                  out.print(ans+"\n");
              }
          }
          out.close();
      }
  
      // fast input
      static class Scanner {
          public BufferedReader reader;
          public StringTokenizer tokenizer;
  
          public Scanner(InputStream stream) {
              reader = new BufferedReader(new InputStreamReader(stream));
              tokenizer = null;
          }
  
          public String next() {
              while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                  try {
                      String line = reader.readLine();
                      if (line == null)
                          return null;
                      tokenizer = new StringTokenizer(line);
                  } catch (Exception e) {
                      throw(new RuntimeException());
                  }
              }
              return tokenizer.nextToken();
          }
  
          public int nextInt() { return Integer.parseInt(next()); }
          public long nextLong() { return Long.parseLong(next()); }
          public double nextDouble() { return Double.parseDouble(next()); }
      }
  
      // fast output
      static class OutputWriter {
          BufferedWriter writer;
  
          public OutputWriter(OutputStream stream) {
              writer = new BufferedWriter(new OutputStreamWriter(stream));
          }
  
          public void print(int i) throws IOException { writer.write(i); }
          public void print(String s) throws IOException { writer.write(s); }
          public void print(char[] c) throws IOException { writer.write(c); }
          public void close() throws IOException { writer.close(); }
      }
  
  
  }
  