import sys

input = sys.stdin.readline



a, b = [int(i) for i in input().split()]

small = min(a,b)

big = max(a,b)



multi = 1

ans = big

while True:

    ans = big * multi

    if (ans % small) == 0:

        break

    multi += 1



print(ans)

import sys

iput = sys.stdin.readline

sys.setrecursionlimit(10 ** 7)



a, b = list(map(int, input().split()))



def gcd(big, small):

    if small == 0:

        return big

    else:

        return gcd(small, big % small)



# gcd(a, b) * lcm(a, b) == a * b

def lcm(a, b):

    # 除算を先にしてオーバーフローのリスクを軽減する

    # FYI: https://qiita.com/drken/items/0c88a37eec520f82b788#2-2-%E5%8D%98%E7%B4%94%E3%81%AA%E6%9C%80%E5%B0%8F%E5%85%AC%E5%80%8D%E6%95%B0%E3%82%B2%E3%83%BC

    return (a // gcd(a, b)) * b



print((lcm(a, b)))

import sys

input = sys.stdin.readline
a, b = [int(i) for i in input().split()]
small = min(a, b)
big = max(a, b)
multi = 1
ans = big
while True:
    ans = big * multi
    if (ans % small) == 0:
        break
    multi += 1
print(ans)

import sys

iput = sys.stdin.readline
sys.setrecursionlimit(10**7)
a, b = list(map(int, input().split()))


def gcd(big, small):
    if small == 0:
        return big
    else:
        return gcd(small, big % small)


# gcd(a, b) * lcm(a, b) == a * b
def lcm(a, b):
    # 除算を先にしてオーバーフローのリスクを軽減する
    # FYI: https://qiita.com/drken/items/0c88a37eec520f82b788#2-2-%E5%8D%98%E7%B4%94%E3%81%AA%E6%9C%80%E5%B0%8F%E5%85%AC%E5%80%8D%E6%95%B0%E3%82%B2%E3%83%BC
    return (a // gcd(a, b)) * b


print((lcm(a, b)))

-input = sys.stdin.readline -a, b = [int(i) for i in input().split()] -small = min(a, b) -big = max(a, b) -multi = 1 -ans = big -while True: -    ans = big * multi -    if (ans % small) == 0: -        break -    multi += 1 -print(ans) +iput = sys.stdin.readline +sys.setrecursionlimit(10**7) +a, b = list(map(int, input().split())) + + +def gcd(big, small): +    if small == 0: +        return big +    else: +        return gcd(small, big % small) + + +# gcd(a, b) * lcm(a, b) == a * b +def lcm(a, b): +    # 除算を先にしてオーバーフローのリスクを軽減する +    # FYI: https://qiita.com/drken/items/0c88a37eec520f82b788#2-2-%E5%8D%98%E7%B4%94%E3%81%AA%E6%9C%80%E5%B0%8F%E5%85%AC%E5%80%8D%E6%95%B0%E3%82%B2%E3%83%BC +    return (a // gcd(a, b)) * b + + +print((lcm(a, b)))