CF1194A.Remove a Progression

You have a list of numbers from $1$ to $n$ written from left to right on the blackboard.

You perform an algorithm consisting of several steps (steps are $1$-indexed). On the $i$-th step you wipe the $i$-th number (considering only remaining numbers). You wipe the whole number (not one digit).

When there are less than $i$ numbers remaining, you stop your algorithm.

Now you wonder: what is the value of the $x$-th remaining number after the algorithm is stopped?

黑板上从左到右写有一列数字：$1$ 到 $n$。

你执行一个包含若干步骤的算法（步骤编号从 $1$ 开始）。在第 $i$ 步中，你擦除当前剩余数字中的第 $i$ 个数字（注意：擦除的是整个数字，而非单个数位）。

当剩余数字个数少于 $i$ 时，你停止该算法。

现在你想知道：算法停止后，剩余数字中第 $x$ 个数字的值是多少？

The first line contains one integer $T$ ($1 \le T \le 100$) — the number of queries. The next $T$ lines contain queries — one per line. All queries are independent.

Each line contains two space-separated integers $n$ and $x$ ($1 \le x \lt n \le 10^{9}$) — the length of the list and the position we wonder about. It's guaranteed that after the algorithm ends, the list will still contain at least $x$ numbers.

第一行包含一个整数 $T$（$1 \le T \le 100$）—— 查询次数。接下来的 $T$ 行每行包含一个查询。所有查询相互独立。

每行包含两个以空格分隔的整数 $n$ 和 $x$（$1 \le x \lt n \le 10^{9}$）—— 分别表示列表长度以及我们关心的位置。保证在算法结束后，列表中仍至少包含 $x$ 个数。

Print $T$ integers (one per query) — the values of the $x$-th number after performing the algorithm for the corresponding queries.

输出 $T$ 个整数（每个查询对应一个整数）——即对相应查询执行该算法后，第 $x$ 个数的值。