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 {
    static long lcm(long a,long b){
        long x=Math.max(a,b),y=Math.min(a,b);
        while(x%y!=0){
            long t=x%y;
            x=y;y=t;
        }
        return y;
    }
    public static void main(String[] args) {
        Scanner s =new Scanner(System.in);
        while(s.hasNext()){
            long a=s.nextLong(),b=s.nextLong(),lcm=lcm(a,b);
            System.out.printf("%d %d\n",lcm,a*b/lcm);}

    }

}
