Frank explained its friend Felman the algorithm of Euclides to calculate the GCD of two numbers. Then Felman implements it algorithm

int gcd(int a, int b)
{
	if (b==0)
		return a;
	else
		return gcd(b,a%b);
}

and it proposes to Frank that makes it but with a little integer and another integer that has up to 250 digits.

Your task is to help Frank programming an efficient code for the challenge of Felman.

Input

The first line of the input file contains a number representing the number of lines to follow. Each line consists of two number A and B (0 <= A <= 40000 and A <= B < 10^250).

Output

Print for each pair (A,B) in the input one integer representing the GCD of A and B.

Example

Input:
2
2 6
10 11

Output:
2
1

Source limit is 1,000 Bytes.

---

hide comments

< Previous 1 2 3 4 5 6 7 8 9 10 Next >
	imkiller: 2018-06-01 13:59:52 Python AC in oneGo!
	pithoriya: 2018-02-14 18:44:42 use Boost ....
	sinersnvrsleep: 2017-12-18 11:58:13 easy in c++ too will make the concepts more clear try it
	madhur4127: 2017-09-02 16:44:00 piece of cake in python!
	shauryauppal: 2017-07-06 19:50:26 Input in string would give u wrong answer While input in a char array of size 300 would give you AC.
	one_mole: 2017-06-26 16:48:13 corner case A = 0.
	ankit1cool: 2017-06-13 12:20:36 cake walk using python
	sas1905: 2017-05-25 23:59:18 4 lines code in python :P
	rohit9934: 2017-03-08 13:05:45 after a lot of struggle,Finally Green Tick
	nilabja16180: 2017-03-01 16:48:47 python AC in one GO!