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 C (judge verdict: Time Limit Exceeded)

main(){
  long a,b,x,i,t;
  while(scanf("%ld %ld",&a,&b)!=-1)
    {
      if(a>b)
	i=b;
      else
	i=a;
      while(a%i!=0 || b%i!=0)
	i--;
      x=i;
      if(a<b)
	i=b;
      else
	i=a;
      while(i%a!=0 || i%b!=0)
	i+=x;
      printf("%ld %ld\n",x,i);
    }
    return 0;
}