import sys
#sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
from collections import defaultdict
def ceil(A,B):
    return -(-A//B)
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(sys.stdin.readline().rstrip())
    def IC(): return [int(c) for c in sys.stdin.readline().rstrip()]
    def MI(): return map(int, sys.stdin.readline().split())
    N = II()
    from math import sqrt
    for i in range(N):
        A,B = MI()
        T = int(sqrt(A) + sqrt(B))
        for x in range(max(1,T-5),T+5):
            if(2*A*B<x**4+A**2+B**2-2*A*x*x-2*B*x*x):
                print(x)
                break
    return
solve()