题解 | #求最小公倍数#

import sys
import math

line=sys.stdin.readline()[:-1]

line_list=line.split()

m=int(line_list[0])
n=int(line_list[1])

## method1
# print(math.lcm(m, n))
# print(math.gcd(m, n))

# method2
def gcd(m, n):
    if m<n:
        m,n=n,m
    reminder=m%n
    if reminder==0:
        return n
    else:
        return gcd(n, reminder)

# def gcd(x, y):
#     while y != 0:
#         (x, y) = (y, x % y)
#     return x

gcd=gcd(m, n)
least_commone_multiple=int(m*n/gcd)
print(least_commone_multiple)