Write a program which computes the greatest common divisor (GCD) and the least common multiple (LCM) of given a and b.

Constraints

* 0 < a, b ≤ 2,000,000,000
* LCM(a, b) ≤ 2,000,000,000
* The number of data sets ≤ 50

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.

Output

For each data set, print GCD and LCM separated by a single space in a line.

Example

Input

8 6
50000000 30000000


Output

2 24
10000000 150000000
def gcd(x, y):
	if y == 0L:
		return x
	elif x < y:
		return gcd(y, x)
	else:
		ny = x % y
		return gcd(y, ny)

while True:
	try:
		inpt = map(long, raw_input().split())
		g = gcd(inpt[0], inpt[1])
		h = inpt[0] * inpt[1] / g
		print str(g) + ' ' + str(h)

	except:
		break