# GCD & LCM Inverse

Time Limit: 2000MS

Memory Limit: 65536K

[显示标签]

## Description

Given two positive integers a and b, we can easily calculate the greatest common divisor (GCD) and the least common multiple (LCM) of a and b. But what about the inverse? That is: given GCD and LCM, finding a and b.

## Input

The input contains multiple test cases, each of which contains two positive integers, the GCD and the LCM. You can assume that these two numbers are both less than 2^63.

## Output

For each test case, output a and b in ascending order. If there are multiple solutions, output the pair with smallest a + b.

## Sample Input

3 60

## Sample Output

12 15

N/A