{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\r\n\tGiven two positive integers a and b, we can easily calculate the greatest common divisor (\u003cspan data-scayt_word\u003d\"GCD\" data-scaytid\u003d\"1\"\u003eGCD\u003c/span\u003e) and the least common multiple (LCM) of a and b. But what about the inverse? That is: given \u003cspan data-scayt_word\u003d\"GCD\" data-scaytid\u003d\"2\"\u003eGCD\u003c/span\u003e and LCM, finding a and b.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\r\n\tThe input contains multiple test cases, each of which contains two positive integers, the \u003cspan data-scayt_word\u003d\"GCD\" data-scaytid\u003d\"3\"\u003eGCD\u003c/span\u003e and the LCM. You can assume that these two numbers are both less than 2^63.\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003e\r\n\tFor each test case, output a and b in ascending order. If there are multiple solutions, output the pair with smallest a + b.\u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e\r\n3 60\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e\r\n12 15\u003c/pre\u003e"}}]}