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 >
	vladimira: 2017-02-26 18:27:32 when a = 0 just print b, cost me few wa
	scorpion_ajay: 2017-02-16 16:48:22 care about when one of the variables is 0,,,,, costed me ample of wrong answers ;(
	rajat_singhal: 2017-01-10 11:03:24 is A=1 and B=10^25 then b%a=b nd time limit exceed them what to do,,,
	praney_rai: 2016-12-27 12:55:01 wow!! really a nice question.. highly recommended for beginners..
	flyingduchman_: 2016-11-20 17:19:29 CLRS textbook and Theorem 31.9 states that, gcd(b,a) = gcd(a , b%a) , so you reduce the big string by (b%a) using pen-paper division method. Then call gcd(a, reduced b) and get AC. pen-paper division method: find 934/7 by hand on paper and see how you find remainder.
	rmaurya: 2016-10-27 19:33:04 no JAVA..:(
	sandeep_4141: 2016-10-26 19:55:49 really take care when a==0,cost 1 WA ..but finally AC!
	sonali9696: 2016-07-08 22:18:19 simple high school mathematics :)
	suraj: 2016-06-28 09:27:43 take care when a=0
	gohanssj9: 2016-05-11 09:49:49 Be careful of a=0 value. And also remove unnecessary details from your code,because I got an error when I tried to submit a code with unnecessary details. After removing those things, it ran successfully.