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(void)
{
    int m,n;
   int  lcm_num=lcm(m,n);
   int gcd_num=gcd(m,n);
   scanf("%d,%d", &m,&n);
    printf("%d", &gcd_num);
    printf("%d", &lcm_num);
    return 0;
}
    
   int  gcd(m,n){
    
    while (m != n){
        if(m >n)
            m=m-n;
        else
            n=n-m;
    }
    return m;
    }
    int lcm(m,n)
    {
     return (m*n/gcd(m,n) );  
    }