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 >
	Paul Draper: 2012-12-01 21:14:01 Why no Java?
	Mathan Kumar: 2012-10-01 19:26:45 What is the o/p for 0 and 0??
	StupidGuy: 2012-08-20 15:16:03 Why no Python 2.7?
	napster: 2012-05-23 13:38:32 nice one!!!
	bond 007: 2012-03-23 07:15:50 runtime error (NZEC) can anyone explain me about this error?
	oldmonk: 2011-06-12 10:47:21 give me some test case it 's giving WA
	Piotr KÄ…kol: 2011-05-03 14:11:51 Also don't understand why such strange language restriction. But looking on the author's status it seems that he won't visit this page soon... :-/
	:D: 2011-01-04 13:22:52 Floating point error, most often division by 0. You should read the tutorial.
	Fernandes Sinaga: 2011-01-04 11:05:13 what mean of RE SIGFPE??
	yyf: 2010-12-19 13:18:45 if a=0 then just print b