10811: ABC148 - C - Snack
[Creator : ]
Description
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.
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.
Input
Input is given from Standard Input in the following format:
```
$A$ $B$
```
```
$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.
Constraints
- $1 \leq A, B \leq 10^5$
- $A \neq B$
- All values in input are integers.
- $A \neq B$
- All values in input are integers.
Sample 1 Input
2 3
Sample 1 Output
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 2 Input
123 456
Sample 2 Output
18696
Sample 3 Input
100000 99999
Sample 3 Output
9999900000