CF1814B.Long Legs

A robot is placed in a cell $(0, 0)$ of an infinite grid. This robot has adjustable length legs. Initially, its legs have length $1$.

Let the robot currently be in the cell $(x, y)$ and have legs of length $m$. In one move, it can perform one of the following three actions:

• jump into the cell $(x + m, y)$;
• jump into the cell $(x, y + m)$;
• increase the length of the legs by $1$, i. e. set it to $m + 1$.

What's the smallest number of moves robot has to make to reach a cell $(a, b)$?

一个机器人被放置在无限网格的单元格 $(0, 0)$ 上。该机器人具有可调节长度的腿，初始时腿长为 $1$。

假设机器人当前位于单元格 $(x, y)$，且腿长为 $m$。在一次移动中，它可以执行以下三种操作之一：

• 跳跃至单元格 $(x + m, y)$；
• 跳跃至单元格 $(x, y + m)$；
• 将腿长增加 $1$，即设为 $m + 1$。

机器人到达单元格 $(a, b)$ 所需的最少移动次数是多少？

The first line contains a single integer $t$ ($1 \le t \le 100$) — the number of test cases.

The only line of each test case contains two integers $a$ and $b$ ($1 \le a, b \le 10^9$) — the ending cell.

第一行包含一个整数 $t$（$1 \le t \le 100$）—— 测试用例的数量。

每个测试用例仅有一行，包含两个整数 $a$ 和 $b$（$1 \le a, b \le 10^9$）—— 终止单元格的坐标。

For each test case, print a single integer — the smallest number of moves the robot is required to make to reach a cell $(a, b)$ from a cell $(0, 0)$.

对于每个测试用例，输出一个整数——机器人从单元格 $(0, 0)$ 到达单元格 $(a, b)$ 所需的最少移动步数。

In the first testcase, the robot can first jump to $(0, 1)$, then to $(1, 1)$. If it ever increases the length of its legs, it will only be able to jump past $(1, 1)$.

In the second testcase, the robot can jump to $(1, 0)$, then increase the length of its length to $2$ and jump three times to reach $(1, 6)$.

In the third testcase, the robot can increase the length of its legs three times to make it $4$. Then jump to $(0, 4)$. Then jump twice to reach $(8, 4)$.

在第一个测试用例中，机器人可以先跳到 $(0, 1)$，再跳到 $(1, 1)$。如果它曾增加过腿长，则之后将只能跳过 $(1, 1)$。

在第二个测试用例中，机器人可以先跳到 $(1, 0)$，再将腿长增加至 $2$，然后跳跃三次到达 $(1, 6)$。

在第三个测试用例中，机器人可以将腿长增加三次，使其变为 $4$；然后跳到 $(0, 4)$；再跳跃两次到达 $(8, 4)$。