#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

//中国剰余定理
long long extGcd(long long a, long long b, long long &p, long long &q) {  
    if (b == 0) { p = 1; q = 0; return a; }  
    long long d = extGcd(b, a%b, q, p);  
    q -= a/b * p;  
    return d;  
}
ll modpow(ll a,ll n, ll mod) {
  ll res = 1;
  while (n > 0) {
      if (n & 1) res = res * a % mod;
      a = a * a % mod;
      n >>= 1;
  }
  return res;
}

int main(){
    ll t;cin >> t;
    while(t--){
        ll x,k;cin >> x >> k;
        ll a,b;

        /*cout << extGcd(MOD-1,-k,a,b) <<endl;
        cout << extGcd(-k,MOD-1,a,b) <<endl;
        cout << extGcd(-MOD+1,k,a,b) <<endl;
        cout << extGcd(k,-MOD+1,a,b) <<endl;*/

        ll m=MOD-1;
        cout << extGcd(m,k,a,b) <<endl;
        //b%=m;
        if(b<m)b+=m;
        //b%=m;
        //cout << a <<  " " << b <<endl; 
        //cout <<  a << " " << b <<endl;
        cout << modpow(x,b,MOD) <<endl;
    }
    ll p,q;
    /*cout << extGcd(3,5,p,q) <<endl;
    cout << extGcd(-3,5,p,q) <<endl;
    cout << extGcd(3,-5,p,q) <<endl;
    cout << extGcd(-3,-5,p,q) <<endl;*/
}