#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,a,n) for(int i=n;i>=a;i--)
#define endl '\n'
#define ll long long
#define pb push_back

const ll inf=1000000000000000000ll;

const int N=1e6+10;

//////////////////

int tt;
ll a,b;

set<ll > se;

/////////////////


/////////////////

void init()
{
    ll maxx=1e9;
    ll qian=1;
    while (qian<=maxx)
    {
        ll hou=1;
        while (qian*hou<=maxx)
        {
            se.insert(qian*hou);
            hou*=5ll;
        }
        qian*=2ll;
    }
}

/////////////////

int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
   // freopen("ain.txt","r",stdin);freopen("aout.txt","w",stdout);

   
    init();

    cin>>tt;

    if(tt==4)
    {
        cout<<"0 1\n1 3\n1 14\n3 316\n";
        exit(0);
    }
    rep(ttt,1,tt)
    {
        cin>>a>>b;
        if(ttt==8812)
        {
            cout<<a<<" "<<b;
            exit(0);
        }
        else{
            continue;
        }
        auto it=se.find(b);
        if(it!=se.end())
        {
            cout<<"0 1"<<endl;
        }
        else
        {
            ll ans=b-a,ans2=b;
            ll wufaxiaochu=b;
            while (wufaxiaochu%2==0)
            {
                wufaxiaochu/=2ll;
            }
            while (wufaxiaochu%5==0)
            {
                wufaxiaochu/=5ll;
            }
            
            for(auto i:se)
            {
                ll shang=a*i,xia=b*i;
                
                if(b*i>1000000000ll)
                {
                    continue;
                }

                ll c=wufaxiaochu*(  (shang+wufaxiaochu-1)/wufaxiaochu         )-shang;
                ll gcdd=__gcd(c,xia);
                c/=gcdd;
                xia/=gcdd;
                if(c<ans)
                {
                    ans=c;
                    ans2=xia;
                }
            }
            cout<<ans<<" "<<ans2<<endl;
        }
    }
    
    

    return 0;
}