Contest Duration: - (local time) (100 minutes) Back to Home
C - Snack /

Time Limit: 2 sec / Memory Limit: 1024 MB

### 問題文

パーティーでは参加者に 11 個以上のお菓子を配る予定です。

どちらの場合でも均等に配りきることができるようなお菓子の個数の最小値を求めてください。

ただし、 1 個のお菓子を分割して複数人で分けることはできないものとします。

### 制約

• 1 \le A, B \le 10^5
• A \neq B
• 入力はすべて整数

### 入力

A B


### 入力例 1

2 3


### 出力例 1

6


6 個のお菓子があるとき、参加者が 2 人の場合は 3 個ずつ、 3 人の場合は 2 個ずつ配ることができます。

### 入力例 2

123 456


### 出力例 2

18696


### 入力例 3

100000 99999


### 出力例 3

9999900000


Score : 300 points

### Problem Statement

Takahashi is organizing a party.

At the party, each guest will receive one or more snack pieces.

Takahashi predicts that the number of guests at this party will be A or B.

Find the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.

We assume that a piece cannot be divided and distributed to multiple guests.

### Constraints

• 1 \leq A, B \leq 10^5
• A \neq B
• All values in input are integers.

### Input

Input is given from Standard Input in the following format:

A B


### Output

Print the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.

### Sample Input 1

2 3


### Sample Output 1

6


When we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.

### Sample Input 2

123 456


### Sample Output 2

18696


### Sample Input 3

100000 99999


### Sample Output 3

9999900000