#include<bits/stdc++.h>

#define ll  long long
#define ull unsigned long long
#define ld long double
#define pii pair<ll,ll>
using namespace std;
#pragma GCC optimize(3)
#define N 600005
#define M 998244353
ll cnt[N],a[N];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll T;
    cin>>T;
    vector<ll > num;
    num.push_back(1);
    for(ll i=2;i<=1e9;i*=2)
    {
        for(ll j=1;i*j<=1e9;j*=5)
        {
            num.push_back(i*j);
        }
    }
    sort(num.begin(),num.end());
    while(T--)
    {
        ll a,b,base=1;
        cin>>a>>b;
        while(b%2==0) { b /= 2;base*=2; }
        while(b%5==0) { b /= 5;base*=5; }
        a%=b;
        if(a==0)
        {
            cout<<0<<' '<<1<<endl;
            continue;
        }
        ll ans=b,res;
        for(int i=0;num[i]*b*base<=1e9;i++)
        {
            ll t=((b-num[i]*a)%b+b)%b,p=num[i] * b * base;
            ll g=gcd(t,p);
            t/=g;p/=g;
            if(t<ans) {
                ans = t;
                res = p;
            }
        }
        cout<<ans<<' '<<res<<endl;
    }
    return 0;
}
//1 0 0 0 0 0 0 0  2
// 99 88 77 66 55 44 33 22 11
// 100 90 80 70 60 50 40 30 20