Problem:
GCD and LCM

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

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.

Constraints

0 < a, b ≤ 2,000,000,000

LCM(a, b) ≤ 2,000,000,000

The number of data sets ≤ 50

Output

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

Sample Input

8 6
50000000 30000000

Output for the Sample Input

2 24
10000000 150000000

Solution in JAVA (judge verdict: Accepted)

import java.util.Scanner;

public class Main
{
	static Scanner in;
	static long gcd(long p,long q)
	{
		if(p<q){long t=p;p=q;q=t;}
		if(q==0)return p;
		return gcd(q,p%q);
	}
	static long lcm(long p,long q)
	{
		return p*q/gcd(p,q);
	}
	public static void main(String[] args)
	{
		in=new Scanner(System.in);

		while(in.hasNext())
		{
		    long n,m;
			n=in.nextLong();m=in.nextLong();
		    System.out.println(gcd(n,m)+" "+lcm(n,m));
		}
	}
}