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: Wrong Answer)

import java.util.Scanner;

public class Main {
	public static void main(String[] args){
		//?????°??£?¨?
		Scanner sc;
		int a;
		int b;
		int c=1;
		int d;		//????????????????????????
		int i = 0;

		sc = new Scanner(System.in);		//?????????????????§??\?????????

		while(sc.hasNext()){


			a = sc.nextInt();//??\???????????????????????°?????\??????
			b = sc.nextInt();

				while(0 != c%a || 0 != c%b){
					c++;
				}


			if(a==0){
				break;
			}else if(b==0){
				b = a;
				break;
			}else{
				d = a%b;
			}

			while(true){
				d = a%b;
				if(d == 0){
					break;
				}else{
					a = b;
					b = d;
					if(a%b == 0){
						break;
					}
				}
			}
			System.out.println("?????§??¬?´???°:" + b);

			System.out.println("????°???¬?????°:" + c);

			if(i > 50){
				break;
			}
			i = i + 1;

		}

	}
}