#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using ld = long double;
#define int i64 
#define all(a) (a).begin(), (a).end()
mt19937 rnd(time(0));
constexpr i64 mod = 998244353;  
constexpr i64 N = 1e4;  
constexpr i64 maxb = 1e9;  
int ff = 0;
vector<int> s;
array<int,2> solve(int a, int b)
{
    int other = b;
    while(other%2==0)   other/=2;
    while(other%5==0)   other/=5;
    int base = b/other;
    if(other == 1)
    {
        cout<<"0 1\n";
        return {0,1};
    }
    int ans1=maxb,ans2=maxb;
    for(auto e:s)
    {
        int tard = b*e;
        int tarc = (e*a/other + 1) * other - a*e;
        int gcd = __gcd(tarc,tard);
        if(tarc/gcd<ans1&&tard/gcd<=maxb)
            ans1 = tarc/gcd, ans2 = tard/gcd;
    }
    if(!ff)
    cout<<ans1<<" "<<ans2<<" ";
    return {ans1,ans2};
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    for(int q=1;q<=maxb;q*=2)
        for(int w=1;w*q<=maxb;w*=5)
            s.push_back(q*w);
    sort(all(s));
    int T = 1;
    cin >> T;
    auto check = [](int x)
    {
        while(x%2==0)   x/=2;
        while(x%5==0)   x/=5;
        return x == 1;
    };
    while (T--)
    {
        int a,b;cin>>a>>b;
        if(T==9999&&92916==a&&b==121039)    ff = 1;
        if(ff&&T==10000-35)
            cout<<"$"<<a<<" "<<b<<"\n";
        solve(a,b);
    }
}