###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


class UnionFind:

    def __init__(self, n):
        self.parent = [i for i in range(n)]

    def root(self, i):
        if self.parent[i] == i:
            return i
        self.parent[i] = self.root(self.parent[i])
        return self.parent[i]

    def unite(self, i, j):
        rooti = self.root(i)
        rootj = self.root(j)
        if rooti == rootj:
            return
        if rooti < rootj:
            self.parent[rootj] = rooti
        else:
            self.parent[rooti] = rootj

    def same(self, i, j):
        return self.root(i) == self.root(j)


###############################################################################


def f(selected_p, selected_ceil, p, ceil, score):
    if p in selected_p:
        return (None, None)
    q = ceil
    while True:
        q += 1
        if q in selected_ceil:
            continue
        if p * q >= score:
            return (p, None)
        return (p, q)


def main():
    q = intin()
    ablist = intinl(q)

    for a, b in ablist:
        score = a * b
        ceil = int(score ** 0.5)
        if ceil ** 2 == score:
            ceil -= 1

        selected_x = [a]
        selected_y = [b]
        keep_x = []
        keep_y = []
        ans = 0

        for i in range(ceil, max(0, ceil - 100), -1):
            x, y = f(selected_x, selected_y, i, ceil, score)
            if x is not None:
                if y is None:
                    keep_x.append(x)
                else:
                    selected_x.append(x)
                    selected_y.append(y)
                    ans += 1

            y, x = f(selected_y, selected_x, i, ceil, score)
            if y is not None:
                if x is None:
                    keep_y.append(y)
                else:
                    selected_x.append(x)
                    selected_y.append(y)
                    ans += 1

        ans += min(len(keep_x), len(keep_y))

        ans += 2 * max(0, ceil - 100)
        if a <= ceil - 100:
            ans -= 1
        if b <= ceil - 100:
            ans -= 1

        print(ans)


if __name__ == '__main__':
    main()


Measured memory_bytes: 3572