ENIGMATH  PLAY WITH MATH
You would have been fed up with competitive programming questions so far, now it is time to solve little math.
Assume you have a equation A * x  B * y = 0
For a given value of A and B, find the minimum positive integer value of x and y that satisfies this equation.
Input
First line contains T, number of test cases 0 <= T <=1000 followed by T lines.
First line of each test case contains two space seperated integers A and B. 1 <= A, B <=1 000 000 000.
Output
For each test case, output a single line containing two integers x and y (seperated by a single space).
Example
Input: 1 2 3 Output: 3 2
Note:
 Brute force won't pass the given constraint.
 Negative number cases are avoided to make the problem easy.
hide comments
divyaprakash18:
20160710 09:47:42
careless me :( "Print new line after each test case." ..... costed 2 WAs... 

shubham9466:
20160321 05:09:34
Easy!!


newbie:
20151021 13:25:20
got ac in first attempt


sri:
20150903 17:38:48
Nice one! if u get the logic,then it is simple


Bozidar:
20150422 21:41:26
Easy one. Green in first go. 

Sue:
20150228 16:46:45
It's such an easy game :)) 

Adnan Oquaish:
20150125 18:08:28
Nice !! Related Question is Crucial Equations (pc:CEQU). 
Added by:  B.R.ARVIND 
Date:  20130912 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 