Abhishek is very good in finding LCM(Least Common Multiple).
But his friend Mrudul finds a way to confuse Abhishek in finding the LCM.
Mrudul challenges Abhishek.He gave 2 numbers a,b (a<=b) and Abhishek has to find the smallest number that is divisible by all the number between n1 and n2 (both inclusive).
It will be a difficult task for Abhishek to find the above.
//Abhishek se na ho paaega. Help him.
So, help Abhishek to find the smallest number that is divisible by all the numbers between a and b.
INPUT :
First line contains 2 space-separated integers a and b
OUTPUT :
Print the smallest number.
CONSTRAINTS :
0 <= a <= b <=50
0 <= smallest number <=108