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;		//????????????
		//int[] haco;		//??¨?????¨?????????
		//String haco = iter.next();
		//int [][] haco = new int [2][50];
		int y=1;		//????????????
		int z=0;
		int h=0;
		int j=1;

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

		while(sc.hasNext()){


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

			//haco = new int[100];

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

				//haco[h][1] = c;
				//h = h + 1;

			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 + " " + c);
				//haco[j][0] = b;
				//j = j+ 1;

			}
			//System.out.println(z + " " + y);


			if(i > 50){
				break;
			}
			i = i + 1;
			System.out.println(b + " " + c);

		}

		//z = 0;
		//y = 1;

		h = 0;
		j = 0;

		//while(haco.hasNext()){		//???????????????????????????????????§??????

		//while(true){
			//System.out.print(haco[j][0] + " ");
			//j = j + 1;

			//System.out.println(haco[0][h]);
			//h = h + 1;
		//}
			//if(haco[j][0] == null){



			//int g = 0;
			//for(g= 0; g < 2; g++){
				//if(g==1){
					//haco.hasNext();
				//}
				//int in = haco.next();		//??????????????????in?????\??????
				//if(g==0){
					//System.out.print(haco + " ");
					//break;
				//}else{
					//System.out.println(haco);
				//}
			//}

			//System.out.println(y);

			//z = z + 2;
			//y = y + 2;

	}
}
*/




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;
					}
				}
			}

			if(i > 50){
				break;
			}
			i = i + 1;
			System.out.println(b + " " + c);

		}
	}
}