LCM

Time Limit: 1 sec

 

The Problem

In arithmetic and number theory, the least common multiple (also called the lowest common multiple or smallest common multiple) of two integers a and b, usually denoted by LCM(a, b), is the smallest positive integer that is divisible by both a and b.

 

Example,

LCM(8, 12) = 24

LCM(10, 100) = 100

LCM(13, 100) = 1300

LCM(16, 100) = 400

 

The Input

Input file contain a series of line, each line contain two integer numbers m and n (0<m,n<10¹⁰). Input is terminated by EOF.

 

The Output

For each line of input, output will show the LCM of m, n (LCM(m,n)) in a separate line.

 

Sample Input

33 3

18 79

8 12

 

Sample Output

33

1422

24

 

 

 

 

Problem Setter: Shahin ShamS