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 Ruby (judge verdict: Time Limit Exceeded)

require 'prime'
STDIN.each_line do |line|
	a,b = line.split.map(&:to_i).sort
	list = []
	gcd = 0
	lcm = 1
	1.upto(a) do |num|
		if a%num == 0 then
			list << num
		end
	end
	list.each do |num|
		if b%num == 0 then
			gcd = num
		end
	end
	(b/2).downto(2) do |num|
			if a%num == 0 and b%num == 0 then
				a = a/num
				b = b/num
				lcm = lcm*num
				# p "num:#{num}, a:#{a}, b:#{b}, lcm:#{lcm}"
			end
	end
	lcm = lcm * a * b
	puts "#{gcd} #{lcm}"
end