CF1611B.Team Composition: Programmers and Mathematicians

The All-Berland Team Programming Contest will take place very soon. This year, teams of four are allowed to participate.

There are $a$ programmers and $b$ mathematicians at Berland State University. How many maximum teams can be made if:

• each team must consist of exactly $4$ students,
• teams of $4$ mathematicians or $4$ programmers are unlikely to perform well, so the decision was made not to compose such teams.

Thus, each team must have at least one programmer and at least one mathematician.

Print the required maximum number of teams. Each person can be a member of no more than one team.

全贝尔兰团队编程竞赛即将举行。今年，允许由四人组成的团队参赛。

贝尔兰国立大学共有 $a$ 名程序员和 $b$ 名数学家。在满足以下条件的前提下，最多能组成多少支队伍？

• 每支队伍必须恰好由 $4$ 名学生组成；
• 由 $4$ 名数学家或 $4$ 名程序员组成的队伍表现通常不佳，因此决定不组建此类队伍。

因此，每支队伍中必须至少包含 $1$ 名程序员和 $1$ 名数学家。

请输出所能组成的最大队伍数量。每个人至多只能属于一支队伍。

The first line contains an integer $t$ ($1 \le t \le 10^4$) —the number of test cases.

This is followed by descriptions of $t$ sets, one per line. Each set is given by two integers $a$ and $b$ ($0 \le a,b \le 10^9$).

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

接下来是 $t$ 组数据的描述，每组数据占一行。每组数据由两个整数 $a$ 和 $b$（$0 \le a,b \le 10^9$）给出。

Print $t$ lines. Each line must contain the answer to the corresponding set of input data — the required maximum number of teams.

输出 $t$ 行。每行必须包含对应输入数据组的答案——即所需的最大队伍数量。

In the first test case of the example, two teams can be composed. One way to compose two teams is to compose two teams of $2$ programmers and $2$ mathematicians.

In the second test case of the example, only one team can be composed: $3$ programmers and $1$ mathematician in the team.

在示例的第一个测试用例中，可以组成两支队伍。一种组成两支队伍的方式是：每支队伍由 $2$ 名程序员和 $2$ 名数学家组成。

在示例的第二个测试用例中，只能组成一支队伍：该队伍由 $3$ 名程序员和 $1$ 名数学家组成。