#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}

template<int mod>
struct ModInt {
    long long x;
    static constexpr int MOD = mod;
 
    ModInt() : x(0) {}
    ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    explicit operator int() const {return x;}
 
    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }
 
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    ModInt operator%(const ModInt &p) const { return ModInt(0); }         
 
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
 
    ModInt inverse() const{
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }

    ModInt power(long long n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1)
            ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    ModInt power(const ModInt p) const{
        return ((ModInt)x).power(p.x);
    }

    friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
        return os << p.x;
    }
    friend istream &operator>>(istream &is, ModInt<mod> &a) {
        long long x;
        is >> x;
        a = ModInt<mod>(x);
        return (is);
    }
};

using modint = ModInt<mod>;



struct modlog{
  ll m=0,MOD,a;
  vector<ll> A;
  map<ll,int> ma;
  
  modlog(ll a,ll MOD):a(a),MOD(MOD){
    while(m*m<MOD) m++;
    //cout << a << " " << m << endl;
    ll s=1;
    rep(i,m){
      ma[s]=i+1;
      s*=a;s%=MOD;
    }
    A.resize(m+1);
    A[0]=1;
    A[1]=power(power(a,m),MOD-2);
    Rep(i,1,m){
      A[i+1]=A[1]*A[i]%MOD;
    }
  }

  ll power(ll a,ll x){
    a%=MOD;
    if(x==0) return 1;
    ll res=1;
    if(x%2) res=a;
    return power(a*a%MOD,(x >> 1))*res%MOD;
  }

  ll log(ll b){//b==1の時以外は最小のもの
    ll s=0,t=-1;
    while(s<=m){
      if(ma[b*A[s]%MOD]>=1) {
        t=ma[b*A[s]%MOD]-1;
        if(s==0 && t==0) {
          s++;
          continue;
        }
        break;
      }
      s++;
    }
    if(t==-1) return -1;
    return s*m+t;
  }
};

//gcd(a,b)を返す
//a*x+b*y==gcd(a,b)なるx,yが格納される
ll extGCD(ll a,ll b,ll &x,ll &y){
    if(b==0) {
        x=1;y=0;return a;
    }
    ll d=extGCD(b,a%b,y,x);
    y-=a/b*x;
    return d;
}

ll x,k;
modlog mlog(5,mod);

void solve(){
    if(x==0) {
        cout << 0 << endl;
        return;
    }
    ll a,b;extGCD(k,mod-1,a,b);
    a=(a%(mod-1))+mod-1;
    cout << ((modint)x).power(a) << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    int t;cin >> t;
    rep(i,t) {
        cin >> x >> k;
        solve();
    }
}