It is audit day at the rook towers of Chessfield. Cleo spreads the tokens records across the table and picks up a sharp pencil. Task: Read two positive integers a and b and print their least common multiple. Input format: One line with two space-separated integers a and b. Output format: Print lcm(a, b). Constraints: 1 <= a,b <= 1000000000 (the lcm fits a signed 64-bit integer).
Example 1:
Example 2:
Example 3:
Constraints:
1 <= a,b <= 1000000000 (the lcm fits a signed 64-bit integer).
