CF1632C.Strange Test

Igor is in 11th grade. Tomorrow he will have to write an informatics test by the strictest teacher in the school, Pavel Denisovich.

Igor knows how the test will be conducted: first of all, the teacher will give each student two positive integers $a$ and $b$ ($a \lt b$). After that, the student can apply any of the following operations any number of times:

• $a := a + 1$ (increase $a$ by $1$),
• $b := b + 1$ (increase $b$ by $1$),
• $a := a \ | \ b$ (replace $a$ with the bitwise OR of $a$ and $b$).

To get full marks on the test, the student has to tell the teacher the minimum required number of operations to make $a$ and $b$ equal.

Igor already knows which numbers the teacher will give him. Help him figure out what is the minimum number of operations needed to make $a$ equal to $b$.

伊戈尔正在读11年级。明天他将参加学校最严格的老师——帕维尔·杰尼索维奇老师——所监考的信息学考试。

伊戈尔知道考试的流程：首先，老师会给每位学生两个正整数 $a$ 和 $b$（满足 $a \lt b$）。之后，学生可以任意次执行以下任意一种操作：

• $a := a + 1$（将 $a$ 增加 $1$），
• $b := b + 1$（将 $b$ 增加 $1$），
• $a := a \ | \ b$（将 $a$ 替换为 $a$ 与 $b$ 的按位或结果）。

为了在考试中获得满分，学生必须告诉老师：使 $a$ 与 $b$ 相等所需的最少操作次数。

伊戈尔已经知道了老师将给他的具体数值。请帮助他算出：使 $a$ 等于 $b$ 所需的最少操作次数。

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^4$). Description of the test cases follows.

The only line for each test case contains two integers $a$ and $b$ ($1 \le a \lt b \le 10^6$).

It is guaranteed that the sum of $b$ over all test cases does not exceed $10^6$.

每个测试包含多个测试用例。第一行包含测试用例的数量 $t$（$1 \le t \le 10^4$）。随后是各测试用例的描述。

每个测试用例仅一行，包含两个整数 $a$ 和 $b$（$1 \le a \lt b \le 10^6$）。

保证所有测试用例的 $b$ 值之和不超过 $10^6$。

For each test case print one integer — the minimum required number of operations to make $a$ and $b$ equal.

对于每个测试用例，输出一个整数——使 $a$ 和 $b$ 相等所需的最少操作次数。

In the first test case, it is optimal to apply the third operation.

In the second test case, it is optimal to apply the first operation three times.

In the third test case, it is optimal to apply the second operation and then the third operation.

在第一个测试用例中，最优策略是执行第三次操作。

在第二个测试用例中，最优策略是执行第一次操作三次。

在第三个测试用例中，最优策略是先执行第二次操作，再执行第三次操作。