#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;

const ll mod = 1000000007;

ll modpow(ll a, ll b){
    ll ans = 1;
    while(b > 0){
        if(b % 2 == 1){
            ans *= a;
            ans %= mod;
        }
        a *= a;
        a %= mod;
        b /= 2;
    }
    return ans;
}

ll modinv(ll a){ return modpow(a, mod-2); }

pair<ll,ll> extgcd(int a, int b){
    if(a > b){
        pair<ll,ll> S = extgcd(b,a);
        return {S.second, S.first};
    }

    if(a == 1) return {1,0};
    else {
        pair<ll,ll> S = extgcd(b%a, a);
        return {S.second - b/a * S.first, S.first};
    }
}

ll composite_modinv(ll a, ll M){
    ll tmp = extgcd(a, M).first;
    return (tmp % M + M) % M;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);

    int T; cin >> T;
    while(T--){
        ll X, K; cin >> X >> K;
        cout << modpow(X, composite_modinv(K, mod-1)) << endl;
    }
}