/* -*- coding: utf-8 -*-
 *
 * 1287.cc:  No.1287 えぬけー - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MOD = 1000000007;
const int PHM = (2 - 1) * (500000003 - 1);

/* typedef */

typedef long long ll;

/* global variables */

/* subroutines */

int powmod(int a, int n, int mod) {  // a^n % mod
  int pm = 1;
  while (n > 0) {
    if (n & 1) pm = (ll)pm * a % mod;
    a = (ll)a * a % mod;
    n >>= 1;
  }
  return pm;
}

/* main */

int main() {
  // x=n^k,  n^{p-1}=1
  // let k*m=1(mod p-1) -> x^m=(n^k)^m=n^(k*m)=n
  // -> m=1/k(mod p-1)=k^phi(p-1)(mod p-1)
  
  int tn;
  scanf("%d", &tn);

  while (tn--) {
    int x, k;
    scanf("%d%d", &x, &k);

    int m = powmod(k, PHM - 1, MOD - 1);
    int n = powmod(x, m, MOD);

    printf("%d\n", n);
    //printf("x=%d, k=%d, m=%d -> k*m=%lld\n", x, k, m, (ll)k * m % (MOD - 1));
  }
  return 0;
}