#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 7;
const int mod = 998244353;
std::vector<int> vc;
void solve()
{
    ll a, b;
    cin >> a >> b;
    a%=b;
    ll p = b, k = 1;
    while (p % 2 == 0) {
        p /= 2;
        k *= 2;
    }
    while (p % 5 == 0) {
        p /= 5;
        k *= 5;
    }
    ll c=b-a,d=b;
    for(auto it:vc)
    {
        ll tmp=it*b;
        if(tmp>1000000000)continue;
        ll fz=a*it;
        int l=0,r=vc.size();
        r--;
        ll ans=-1;
        while(l<=r)
        {
            ll mid=l+r>>1;
            if(vc[mid]*p>=fz)
            {
                ans=mid;
                r=mid-1;
            }
            else l=mid+1;
        }
        if(vc[ans]*p-fz<=c)
        {
            c=vc[ans]*p-fz;
            d=it*b;
        }
    }
    cout<<c<<' '<<d<<endl;
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    for(ll now=1;now<=1000000000;now*=2)
    for(ll tmp=1;tmp*now<=1000000000;tmp*=5)
    {
        vc.push_back(now*tmp);
    }
    sort(vc.begin(),vc.end());
    int _ = 1;
    cin >> _;
    while (_--)
        solve();
    return 0;
}