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
raghav9352:
20200902 13:52:30
AC IN ONE GO!! 

manish_thakur:
20200318 11:18:45
Don't look for hints in comments, observe for some time , and you'll be good to go!


saketvajp_123:
20191220 11:05:58
take input as 130 and 117 and then check ....


shikhargup_19:
20191031 05:37:16


sahruz_riyad:
20190514 10:16:09
For large number (a*b or b*a) you have to find gcd..


swap99:
20190326 08:44:59
EASY PEASY 

silentknight16:
20190219 18:00:07
AC in one go!! 

rock7897:
20190119 20:18:01
Last edit: 20190119 20:21:37 

ankitpriyarup:
20181219 19:25:17
Took me 2 WA finally ;) 

dhia01:
20180914 03:56:52
Cari KPK nya habistu , a sama b nya di bagi sama KPK nya 
Added by:  B.R.ARVIND 
Date:  20130912 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 