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 >
	jarvis: 2015-09-04 11:50:08 Dear zero :/ costed 1 SIGSEV and two WA Finally AC :)
	Shivam Singh: 2015-08-24 03:41:57 its all about getting the first B%A...
	alok singh: 2015-08-21 16:53:52 sahi hai :)
	sarvagya: 2015-08-18 03:02:31 do it in C,C++ if you want to learn else move to another problem . :P
	Anurag Sharma: 2015-08-06 18:33:40 python should also remove....
	Anurag Sharma: 2015-08-06 18:30:51 why there is not java included.... it sucks :<
	Anurag Sharma: 2015-08-06 18:30:50 why there is not java included.... it sucks :<
	karthik1997: 2015-08-01 21:13:48 https://souvikpal.wordpress.com/2013/02/09/gcd-of-a-very-large-number/ read this it really helped me a lot :D ac in 1st go learnt a new thing :p
	:?ToRpiDo: 2015-07-26 15:42:16 my...Half Century :-) done in 4 languages :-) Last edit: 2015-07-26 15:43:03
	Rishabh Joshi: 2015-06-04 16:42:11 Copy paste in python gets AC. It would be better if you only allowed languages that don't have BIGINT built in.