#include using namespace std; #define INF_LL (int64)1e18 #define INF (int32)1e9 #define REP(i, n) for(int64 i = 0;i < (n);i++) #define FOR(i, a, b) for(int64 i = (a);i < (b);i++) #define all(x) x.begin(),x.end() #define fs first #define sc second using int32 = int_fast32_t; using uint32 = uint_fast32_t; using int64 = int_fast64_t; using uint64 = uint_fast64_t; using PII = pair; using PLL = pair; const double eps = 1e-10; templateinline void chmin(A &a, B b){if(a > b) a = b;} templateinline void chmax(A &a, B b){if(a < b) a = b;} template vector make_v(size_t a){return vector(a);} template auto make_v(size_t a,Ts... ts){ return vector(ts...))>(a,make_v(ts...)); } template typename enable_if::value!=0>::type fill_v(U &u,const V... v){u=U(v...);} template typename enable_if::value==0>::type fill_v(U &u,const V... v){ for(auto &e:u) fill_v(e,v...); } ::std::pair<::std::int64_t, ::std::int64_t> extgcd(::std::int64_t a, ::std::int64_t b) { ::std::pair<::std::int64_t, ::std::int64_t> pa(1, 0), pb(0, 1); while (b != 0) { ::std::swap(a, b); ::std::swap(pa, pb); pb = ::std::make_pair(pb.first - pa.first * (b / a), pb.second - pa.second * (b / a)); b = b % a; } return pa; } // return a^-1 mod (mod) // O(log mod) // // Require -> extgcd ::std::int64_t modinv(::std::int64_t a, ::std::int64_t mod) { ::std::int64_t x = extgcd(a, mod).first; if (x < 0) x += mod; return x; } // return a^b mod (mod) // O(log mod) ::std::int64_t modpow(::std::int64_t a, ::std::int64_t b, ::std::int64_t mod) { ::std::int64_t res = 1; while (b > 0) { if (b & 1) res = res * a % mod; a = a * a % mod; b >>= 1; } return res; } void solve() { int64 X, K; cin >> X >> K; int64 Kinv = modinv(K, 1e9+6); cout << modpow(X, Kinv, 1e9+7) << endl; } int main(void) { cin.tie(0); ios::sync_with_stdio(false); int64 T; cin >> T; REP(_, T) { solve(); } }