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?

Input

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

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

Output

For 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

Note

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.
import java.util.*;
import java.io.*;

public class A {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int t = Integer.parseInt(br.readLine());
        while (t>0) {
            String line = br.readLine();
            String s[] = line.split(" ");
            long a = Long.parseLong(s[0]);
            long b = Long.parseLong(s[1]);
            if (a>b) {
                long temp = a;
                a = b;
                b = temp;
            }
            if (b>=2L*a)
                System.out.println(a);
            else {
                long d = a/3L;
                a = a - d*3L;
                b = b - d*3L;
                d = d*2;
                while (a > 0 && b > 0) {
                    if (a == 1 && b == 1) 
                        break;
                    if (a > b) {
                        long temp = a;
                        a = b;
                        b = temp;
                    }
                    if (a > 0L && b > 1L) {
                        d++;
                        a--;
                        b=b-2L;
                    }
                }            
                System.out.println(d);
            }
            t--;
        }
    }
}