BOJ 2609

최대공약수와 최소공배수

x,y = map(int,input().split())
a = []
b = []
for i in range(1, x+1):
    if x % i == 0:
        a.append(i)
for j in range(1, y+1):
    if y % j == 0:
        b.append(j)
c = []
for k in a:
    if k in b:
        c.append(k)
print(max(c))

print((x*y)//(max(c)))