keverek = []


def lnko(a,b):
    while a != b:
        if a > b:
            a = a-b
        else:
            b = b-a
    return b

for i in range(1,501):
    for j in range(1,501):
        if lnko(i,j) == 1:
            keverek.append([i,j])

keverek.sort(key=lambda x: (x[0]+x[1],x[0]))

T = int(input())
for _ in range(T):
    A,B = map(int,input().split())
    if A > B:
        seged = A
        A = B
        B = seged
    db = 0
    if (A*(A+1)) // 2 <= B:
        print(A)
    else:
        kb = B-A
        osszeg = 0
        n = 0
        while osszeg < kb:
            n += 1
            osszeg += n
        A = A-n
        B = B - osszeg
        db = n
        for i,j in keverek:  
            if i <= A and j <= B:
                if i == 1 and j > n or i != 1:
                    db += 1
                    A -= i
                    B -= j
            if A == 0 or B == 0 or (A < i and B < j):
                break

        print(db)