CF1366A.Shovels and Swords

Polycarp plays a well-known computer game (we won't mention its name). In this game, he can craft tools of two types — shovels and swords. To craft a shovel, Polycarp spends two sticks and one diamond; to craft a sword, Polycarp spends two diamonds and one stick.

Each tool can be sold for exactly one emerald. How many emeralds can Polycarp earn, if he has $a$ sticks and $b$ diamonds?

Polycarp 玩一款著名的电脑游戏（我们不会提及它的名字）。在该游戏中，他可以制作两种工具——铲子和剑。制作一把铲子需要消耗 2 根木棍和 1 颗钻石；制作一把剑需要消耗 2 颗钻石和 1 根木棍。

每件工具恰好可以卖出 1 颗绿宝石。如果 Polycarp 拥有 $a$ 根木棍和 $b$ 颗钻石，他最多能获得多少颗绿宝石？

The first line contains one integer $t$ ($1 \le t \le 1000$) — the number of test cases.

The only line of each test case contains two integers $a$ and $b$ ($0 \le a, b \le 10^9$) — the number of sticks and the number of diamonds, respectively.

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

每个测试用例仅有一行，包含两个整数 $a$ 和 $b$（$0 \le a, b \le 10^9$）—— 分别表示木棍的数量和钻石的数量。

For each test case print one integer — the maximum number of emeralds Polycarp can earn.

对于每个测试用例，输出一个整数——Polycarp 能获得的翡翠的最大数量。

In the first test case Polycarp can earn two emeralds as follows: craft one sword and one shovel.

In the second test case Polycarp does not have any diamonds, so he cannot craft anything.

在第一个测试用例中，Polycarp 可以通过制作一把剑和一把铲子来获得两颗绿宝石。

在第二个测试用例中，Polycarp 没有任何钻石，因此他无法制作任何物品。