Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.

Constraints

* 0 < a, b ≤ 2,000,000,000
* LCM(a, b) ≤ 2,000,000,000
* The number of data sets ≤ 50

Input

Input consists of several data sets. Each data set contains a and b separated by a single space in a line. The input terminates with EOF.

Output

For each data set, print GCD and LCM separated by a single space in a line.

Example

Input

8 6
50000000 30000000


Output

2 24
10000000 150000000
import java.util.*;

public class Main
{
    private static int gcd(int x, int y)
    {
        if (0 == y)
            return x;
        return gcd(y, x % y);
    }

    private static int lcm(int x, int y)
    {
        return x  / gcd(x, y) * y;
    }

    public static void main(String[] main)
    {
        Scanner in = new Scanner(System.in);

        while (in.hasNext())
        {
            int x = in.nextInt();
            int y = in.nextInt();

            System.out.print(gcd(x, y) + " " + lcm(x, y));
            System.out.println();
        }
    }
}