Shovels and Swords 二元一次方程

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 aa sticks and bb diamonds?InputThe first line contains one integer tt (1≤t≤10001≤t≤1000) — the number of test cases.
The only line of each test case contains two integers aa and bb (0≤a,b≤1090≤a,b≤109) — the number of sticks and the number of diamonds, respectively.OutputFor each test case print one integer — the maximum number of emeralds Polycarp can earn.Example

Input

4
4 4
1000000000 0
7 15
8 7

Output

2
0
7
5

NoteIn the first test case Polycarp ca