"""练习 14 进阶版：用 math.gcd 取得最大公约数，再计算最小公倍数。"""
from math import gcd

a, b = map(int, input().split())
if a <= 0 or b <= 0:
    raise ValueError("请输入两个正整数")

greatest_common_divisor = gcd(a, b)
least_common_multiple = a // greatest_common_divisor * b
print("gcd:", greatest_common_divisor)
print("lcm:", least_common_multiple)