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
aman9598:
20180530 15:53:35
its my 50th


rishapverma100:
20180123 15:40:03
just find the lcm then divide lcm by a and b...x and y will be respective values....AC in one go... 

vkash:
20180103 11:24:07
AC in one Go...!! 

gourav_123:
20171209 18:50:13
dont read comments.... 

moder_gabbar07:
20171203 17:51:45
just solve eq for x and y.


nadstratosfer:
20171202 03:23:07
Print minimum values of (x,y) not value of x&y, and not minimum value of x followed by matching y. Print each result on a separate line, don't insert additional newlines like comments suggest. Crap statement and crap judge: if a < b print the bigger value first else WA. WTF! 

him_novice:
20170905 05:15:37
Easiest question... Don't forget to print new line. Costed me one WA 

secrets_inside:
20170820 16:39:14
i used


raichu7:
20170730 03:45:42
AC in one go :) 

one_mole:
20170629 14:40:59
Last edit: 20170629 14:41:55 
Added by:  B.R.ARVIND 
Date:  20130912 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 