n = int(input())


def is_ok(mid, a, b):
  c = mid*mid-a-b
  if(c < 0):
    return False
  
  if(4*a*b < c*c):
    return True
  else:
    return False

def binary_search(ng, ok, a, b):
    while ok - ng > 1:
        mid = (ok + ng) // 2
        if is_ok(mid, a, b):
            ok = mid
        else:
            ng = mid
    return ok




for _ in range(n):
  a,b = map(int, input().split()) 
  
  x = binary_search(0, 10**9, a, b)
  
  print(x)