## Problem

Chef is fond of burgers and decided to make as many burgers as possible.

Chef has  patties and  buns. To make 1 burger, Chef needs 1 patty and 1 bun.
Find the maximum number of burgers that Chef can make.

### Input Format

• The first line of input will contain an integer  — the number of test cases. The description of  test cases follows.
• The first and only line of each test case contains two space-separated integers  and , the number of patties and buns respectively.

### Output Format

For each test case, output the maximum number of burgers that Chef can make.

• 1≤�≤1000
• 1≤�,�≤105

### Sample 1:

Input

Output

4
2 2
2 3
3 2
23 17
2
2
2
17


### Explanation:

Test case 1: Chef has 2 patties and 2 buns, and therefore Chef can make 2 burgers.

Test case 2: Chef has 2 patties and 3 buns. Chef can make at most 2 burgers by using 2 patties and 2 buns.

Test case 3: Chef has 3 patties and 2 buns. Chef can make at most 2 burgers by using 2 patties and 2 buns.

Test case 4: Chef has 23 patties and 17 buns. Chef can make at most 17 burgers by using 17 patties and 17 buns.

## Code Examples

### #1 Code Example with C Programming

Code - C Programming

#include<stdio.h>

int main(void) {
int t,p,b;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&p,&b);
if(p>b) printf("%d\n",b);
else printf("%d\n",p);
}
return 0;
}
Copy The Code &

Input

cmd
4
2 2
2 3
3 2
23 17

Output

cmd
2
2
2
17