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 koubai(int a,int b);
int kouyaku(int a,int b);
int main(void){
  int a,b;

  while(scanf("%d %d",&a,&b) != EOF){
    printf("%d %d\n",kouyaku(a,b),koubai(a,b));
  }
  return 0;
}
int koubai(int a,int b){
  int i,bai;

  for(i=1;i<=a*b;i++){
    if(i%a==0 && i%b==0)
      bai =i;
   break;
  }

  return i;
}
int kouyaku(int a,int b){

  int i,yaku;

  for(i=1;i<=a || i<=b;i++){
    if(a%i==0 && b%i==0)
      yaku =i;
  }
  return yaku;
}