2829. The Very Greatest Common Divisor

输入格式

The first line of the input file contains number n < 250 of test cases. The description of a test case consists of two lines. The first line contains integer a (0 < a < 10¹²⁵⁴⁰), the second – integer b (0 < b < 10¹²⁵⁴⁰).

输出格式

For each test case print the greatest common divisor of integers a and b on a separate line.

3
2
3
3
21
6765
610

1
3
5