#include using namespace std; #define LOCAL #pragma region Macros typedef long long ll; #define ALL(x) (x).begin(),(x).end() const long long MOD=1000000007; // const long long MOD=998244353; const int INF=1e9; const long long IINF=1e18; const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1}; const char dir[4]={'D','R','U','L'}; template istream &operator>>(istream &is,vector &v){ for (T &x:v) is >> x; return is; } template ostream &operator<<(ostream &os,const vector &v){ for (int i=0;i ostream &operator<<(ostream &os,const pair &p){ os << '(' << p.first << ',' << p.second << ')'; return os; } template ostream &operator<<(ostream &os,const map &m){ os << '{'; for (auto itr=m.begin();itr!=m.end();++itr){ os << '(' << itr->first << ',' << itr->second << ')'; if (++itr!=m.end()) os << ','; --itr; } os << '}'; return os; } template ostream &operator<<(ostream &os,const set &s){ os << '{'; for (auto itr=s.begin();itr!=s.end();++itr){ os << *itr; if (++itr!=s.end()) os << ','; --itr; } os << '}'; return os; } void debug_out(){cerr << '\n';} template void debug_out(Head&& head,Tail&&... tail){ cerr << head; if (sizeof...(Tail)>0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) cerr << " ";\ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\ cerr << " ";\ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template T gcd(T x,T y){return y!=0?gcd(y,x%y):x;} template T lcm(T x,T y){return x/gcd(x,y)*y;} template inline bool chmin(T1 &a,T2 b){ if (a>b){a=b; return true;} return false; } template inline bool chmax(T1 &a,T2 b){ if (a bs; for(int64_t s = 0, e = b; s < h; bs[e] = ++s) { (e *= a) %= n; } for(int64_t s = 0, e = t; s < n;) { (e *= gs) %= n; s += h; if(bs.count(e)) return c + s - bs[e]; } return -1; } long long modpow(long long x,long long n,long long mod){ long long res=1; while (n>0){ if (n&1LL) res=res*x%mod; x=x*x%mod; n>>=1LL; } return res; } constexpr int r=5; template T euler_phi(T n){ T res=n; for (T i=2;i*i<=n;++i) if (n%i==0){ res-=res/i; while (n%i==0) n/=i; } if (n!=1) res-=res/n; return res; } int main(){ cin.tie(0); ios::sync_with_stdio(false); int T; cin >> T; for (;T--;){ ll X,K; cin >> X >> K; if (X==0){ cout << 0 << '\n'; return 0; } ll x=mod_log(r,X,MOD),inv=modpow(K,500000001,MOD-1); assert(x>=0); (x*=inv)%=(MOD-1); ll ans=modpow(r,x,MOD); cout << ans << '\n'; } }