import math
from collections import defaultdict

def Divisors(N):
    divisors=[]
    for i in range(1,N+1):
        if i**2>=N:
            break
        elif N%i==0:
            divisors.append(i)
    if i**2==N:
        divisors+=[i]+[N//i for i in divisors[::-1]]
    else:
        divisors+=[N//i for i in divisors[::-1]]
    return divisors

Q=int(input())
for q in range(Q):
    a,b,c,d=map(int,input().split())
    M=10**18
    def tree(p,q):
        D=Divisors(q-p)
        def f(p,q):
            if q-p==1:
                return [(1,p,M)]
            lst=[]
            for d in D[1:]:
                if (q-p)%d==0:
                    lst.append((-p)%d)
            mi=min(lst)
            pp=p+mi
            qq=q+mi
            g=math.gcd(pp,qq)
            return [(q-p,p,pp)]+f(pp//g,qq//g)
        return f(p,q)
    tree0=tree(a,b)
    tree1=tree(c,d)
    dct=defaultdict(list)
    for d,a,b in tree0+tree1:
        dct[d].append((a,b))
    assert len(tree0)<=30
    assert len(tree1)<=30
    lst=[]
    for d in dct:
        if len(dct[d])==2:
            (a0,b0),(a1,b1)=dct[d]
            a=max(a0,a1)
            b=min(b0,b1)
            if a<=b:
                lst.append((d,a))
    d,a=min(lst)
    print(a,a+d)