def gcd(x,y):
    if y==0:
        return x
    else: return gcd(y,x%y)
f=int(input())
#=int(input())
while(f>0):
    two=1
    a, b = map(int, input().split())
    ans1=9999999999999999
    ans2=9999999999999999
    for i in range(30):
        five=1
        for j in range(13):
            tem=a*two*five
            m=0
            if tem<=b:
                m=int(b/tem)
            else :
                m=int(tem/b)+(tem%b>0)
            c=m*b-tem
            fenmu=b*two*five
            k=gcd(c,fenmu)
            fenmu/=k
            #print(k)
            c/=k
            five*=5
            if fenmu>1000000000:
                break
            if ans1>c:
                ans1=c
                ans2=fenmu
            else: continue
        two*=2
    print(int(ans1),int(ans2))
    f-=1