//
// Created by 16373 on 2024/11/13.
//
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod=998244353,inf=1e18;
int qpow(int a,int x){
    int res=1;
    while(x){
        if(x&1) res=res*a;
        x>>=1;
        a*=a;
    }
    return res;
}
void solve(){
    int a,b;
    cin>>a>>b;
    int prime=b;
    int cnt2=0,cnt5=0;
    while(prime%2==0){
        cnt2++;
        prime/=2;
    }
    while(prime%5==0){
        cnt5++;
        prime/=5;
    }
    int pw2=qpow(2,cnt2),pw5=qpow(5,cnt5);
    int now2=1;
    unordered_map<int,pair<int,int>> mp;
    for(int i=0;prime*now2*pw2*pw5<=inf;i++,now2*=2){
        int now=now2;
        for(int j=0;prime*now*pw2*pw5<=inf;j++,now*=5){
            int md=a*now%prime;
            int ans=(prime-md)%prime;
//            cout<<i<<' '<<j<<' '<<ans<<'\n';
            if(!mp.count(ans)){
                mp[ans]={i,j};
            }
        }
    }
    int c=inf,d;
    for(auto e:mp){
        int pre=e.first;
        auto sub=e.second;
        int n2=sub.first,n5=sub.second;
//        cout<<n2<<' '<<n5<<'\n';
        int nc=pre,nd=prime*pw2*pw5*qpow(2,n2)*qpow(5,n5);
        int gc=__gcd(nc,nd);
        nc/=gc;  nd/=gc;
        if(nd<=(int)1e9 && nc<c){
//            cout<<nc<<' '<<nd<<'\n';
            c=nc; d=nd;
        }
    }
    cout<<c<<' '<<d<<'\n';
}
signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}
//2
//630
//3029 2336 377 41 10 61
//3000
//20000 10000 0 0 0 0