Description

Given two positive integers, find their greatest common divisor (GCD).

Input Format

The first line contains an integer $n$ ($0 < n ≤100$), indicating the number of test cases.
Each of the following $n$ lines contains two integers $x$ and $y$ ($0 < x,y≤10000$).

Output Format

Output the greatest common divisor for each test case.

Sample

3
6 6
12 11
33 22

6
1
11