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) {
    	long val1,val2;
        long r=1;
        long LCM;

        Scanner sc = new Scanner(System.in);

        while(sc.hasNext()) {
        	val1 = sc.nextInt();
        	val2 = sc.nextInt();

        	r = 1;
        	long tmp1=val1,tmp2=val2;
        		if(val1<val2){
        			val1 = tmp2;
        			val2 = tmp1;
        		}

        		while(r>0){
        			r = val1 % val2;
        			val1 = val2;
        			val2 = r;
        		}
         LCM = tmp1* tmp2/val1;
        System.out.printf("%d %d", val1, LCM);
        }
    }

}