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)

#include<stdio.h>
int main(){
  
  long long a,b,c,d,e,ans2,ans1,i; 
  
  while(scanf("%lld %lld",&a,&b)!=EOF){
    
    for(i=1;i<=a*b;i++){
      if(i%a==0 && i%b==0){
	ans2=i;
	break;
      }
    }

    if(b>a){
      c=a;
     a=b;
     b=c;
    }
    
   while(1){
     c=a%b;
     a=b;
     b=c;
     if(c==0){
       break;
     }
   }
   ans1=a;
   
   printf("%lld %lld\n",ans1,ans2);
   a=b=c=ans1=0;
   ans2=0;
  }
  
  return 0;
}