题面
One night,sunny and solofandy go to bedchamber,they are so funny,they wanted to jump to bedchamber.But there meet a problem,everytime the length of the two boys jumping is different,so I want you to calculate the shortest length they will meet again.
输入格式
There are several cases,each case there are two numbers a and b,stand for the length of the two boys jumping.
输出格式
For each case,output a line contain a number of the shortest length they will meet again.
样例
输入
2 3 4 6 5 11
输出
6 12 55