#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define i128 __int128_t
#define PLL pair<ll,ll>

ll p2[50],p5[50],t;
PLL res;

PLL fun(PLL a,PLL b){
    if(a.first<b.first) return a;
    if(a.first==b.first&&a.second<b.second) return a;
    return b;
}

void init(){
    p2[0]=p5[0]=1;
    for(int i=1;i<=35;i++){
        p2[i]=p2[i-1]*2;
    }
    for(int i=1;i<=15;i++){
        p5[i]=p5[i-1]*5;
    }
}

ll gcd(ll a, ll b)
{
    return b ? gcd(b, a % b) : a;
}

void solve(){
    PLL res={1e9+10,1e9+10};
    ll a,b,b0,num2=0,num5=0;
    cin>>a>>b;
    
    b0=b;
    while(b0%2==0){
        b0=b0/2;
        num2++;
    }
    b0=b;
    while(b0%5==0){
        b0=b0/5;
        num5++;
    }

    b0=b;
    while(b0%2==0) b0=b0/2;
    while(b0%5==0) b0=b0/5;

    for(int i=num2;i<=30;i++){
        for(int j=num5;j<=13;j++){
            ll d=p2[i]*p5[j];
            if(d>1e9) continue;
            d=d*b0;
            if(d>1e9) continue;

            ll aa=a*p2[i-num2]*p5[j-num5];
            ll k=aa/b0;
            ll c=k*b0-aa;
            if(c<0) c+=b0;
            
            ll g=gcd(c,d);
            c=c/g,d=d/g;
            res=fun(res,{c,d});
        }
    }
    cout<<res.first<<' '<<res.second<<endl;
    return;
}

int main(){
    init();
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}