# 10**9全探索はできないがsqrt(10**6)なら全探索可能
# A < Bとする

from math import floor, ceil

T = int(input())
for t in range(T):
    A, B = map(int, input().split())
    if A > B:
        A, B = B, A

    mn = floor(A**0.5)*2
    mx = ceil(B**0.5)*2
    #print('mn', mn, 'mx', mx)
    
    NG = mn 
    OK = mx+10
    
    while OK-NG>1:
        mid = (OK+NG)//2
        if (mid**2-A-B) > 0 and 4*A*B < (mid**2-A-B)**2:
            OK = mid
        else:
            NG = mid
    print(OK)