#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<ll>p;
unordered_map<ll, bool>f;
ll T;

bool check(ll x)
{
    while(x%2==0)x/=2;
    while(x%5==0)x/=5;
    return x==1;
}

void solve()
{
    ll a, b, c, ans = LLONG_MAX, max_z, max_y;
    cin>>a>>b;
    if(check(b))
    {
        cout<<0<<" "<<1<<endl;
        return;
    }
    for(int i = 0;i<p.size();i++)
    {
        ll y = p[i];
        ll z = y*a/b + 1;
        c = z*b - y*a;
        if(c<ans)
        {
            ans = c;
            max_z = z;
            max_y = y;
        }
    }
    ll L1 = max_z*b - max_y*a, L2 = max_y*b;
    ll d = max_y*b/__gcd(L1, L2);
    ll t = __gcd(ans, d);
    cout<<ans/t<<" "<<d/t<<endl;
}

void dfs(ll x)
{
    if(x<=1e15)
    if(!f[x]){
        f[x] = 1;
        p.push_back(x);
        dfs(2*x);
        dfs(5*x);
    }
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int tt;
    cin>>tt;
    dfs(1);
    while(tt--)
    {
        solve();
    }
    return 0;
}