#include<iostream>
#include<vector>
#include<cmath>
#define int long long
int a,b;
std::vector<std::pair<int,int> > bm;
std::vector<int> bm2;
int ans=0;
void dfs(int now=0,int mul=1)
{
    if(now==bm.size())
    {
        bm2.push_back(mul);
        return ;
    }
    for(int i=0;i<=bm[now].second;i++)
    {
        dfs(now+1,mul);
        mul*=bm[now].first;
    }
}
int ml[2]={2,5};
void dfs2(int c,int now=0,int mul=1)
{
    if(ans!=0) return ;
    if(now==2)
    {
        for(int i=0;i<bm2.size();i++)
        {
            if((c*bm2[i]+a*mul)%b==0)
            {
                if(b*mul/bm2[i]<=1000000000) 
                {
                    ans=b*mul/bm2[i];
                    return ;
                }
            }
        }
        return ;
    }
    while(mul<=1000000000)
    {
        dfs2(c,now+1,mul);
        if(ans!=0) return ;
        mul*=ml[now];
    }
}
signed solve()
{
    bm.clear();
    bm2.clear();
    ans=0;
    std::cin>>a>>b;
    int x=b;
    for(int i=2;i<=sqrt(x);i++)
    {
        if(x%i==0) bm.push_back({i,0});
        while(x%i==0)
        {
            bm[bm.size()-1].second++;
            x/=i;
        }
    }
    if(x!=1) bm.push_back({x,1});
    for(int i=0;i<bm.size();i++)
        if(bm[i].first!=2&&bm[i].first!=5)
        {
            goto label;
        }
    std::cout<<"0 1\n";
    return 0;
    label:dfs();
    for(int c=1;c<=b;c++)
    {
        dfs2(c);
        if(ans!=0)
        {
            std::cout<<c<<' '<<ans<<'\n';
            return 0;
        }
    }
    return 0;
}
signed main()
{
    int T;
    std::cin>>T;
    while(T--)
    {
        solve();
    }
}