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.Scanner;

class Main{
	static class Pair{
		public long x, y;
		Pair( long xx, long yy ){ x=xx; y=yy; }
	}
	public static void main(String[]av){
		Scanner sc = new Scanner( System.in );
		java.util.ArrayList<Pair> list = new java.util.ArrayList<Pair>();
		while( sc.hasNextInt() )	{
			long x = sc.nextInt();
			long y = sc.nextInt();
			list.add( new Pair( Math.max(x,y), Math.min(x,y)));
		}
		for ( Pair p : list ){
			long x = p.x;
			long y = p.y;
			do{
				long	z = x % y;
				x = y;
				y = z;
			}while( 0 < y );
			System.out.println( x + " " + p.x*p.y/x );
		}
	}
}
				