Given integers. You have to find the maximum GCD (greatest common divisor) of every possible pair of these integers.
The first line contains the number of test cases .
The following lines are the test cases. Each test case contains positive integers.
For each test case, print on a separate line the maximum GCD value among all possible pairs of integers.
For the first test case, the answer is GCD(20, 40) = 20.
For the third test case, the answer is GCD(125, 25) = 25.