Gears#4744
Consider two interconnected gears. One gear has teeth, and the other has teeth.
Your task is to determine the minimum number of rotations per tooth needed for both gears to return to their starting positions.
The input consists of a single line containing two integers, and (1 \le N, K \le 10^7).
Output the minimum number of teeth rotations required. It is guaranteed that this number will not exceed 10^9.
Example 1