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 >
	Tejas Meshram: 2015-05-20 14:37:33 got to know about boost :) (y)
	Rahul Jain: 2015-02-14 17:23:05 never thought that my century would end up with solving such a silly problem :(
	Madhav: 2015-02-09 13:15:57 good question..learnt something new!!
	Aayush: 2015-01-07 08:46:05 Just copy-pasted gcd() in python. AC :/
	Abhinandan Agarwal: 2015-01-05 08:57:15 guys, add the 0 xepction
	Jackson: 2014-12-13 13:10:55 got WA since forgot to add new line in "0" exception... Easy One...
	reddappa: 2014-12-02 11:16:19 getting WA pls chk id = 13031100
	pankaj: 2014-11-10 15:32:05 after 2 WA got AC
	premsai: 2014-10-23 11:04:11 keep getting WA, checked all test cases, id=12699717 Last edit: 2014-10-23 11:05:06
	Vamsi Krishna Avula: 2014-10-21 12:02:58 @atheistaltini pypy and pyth 3.4 are available only in cube cluster.