Takahashi is organizing a party.

At the party, each guest will receive one or more snack pieces.

Takahashi predicts that the number of guests at this party will be A or B.

Find the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.

We assume that a piece cannot be divided and distributed to multiple guests.

Constraints

* 1 \leq A, B \leq 10^5
* A \neq B
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


A B


Output

Print the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.

Examples

Input

2 3


Output

6


Input

123 456


Output

18696


Input

100000 99999


Output

9999900000
import java.util.*;
class Main{
	public static void main(String[] args){
		Scanner scn = new Scanner(System.in);
		long num1 = scn.nextInt();
		long num2 = scn.nextInt();
		System.out.println(CommonMultipleNum.cmn(num1,num2));
	}
}
class CommonMultipleNum{
	static long cmn(long num1,long num2){
		//総当たり戦。頑張る。
		long tmp;
		long num3 = num1;
		num3 *= num2;//3点交換
		while((tmp= num1%num2)!=0){
			num1 = num2;
			num2 = tmp;
		}
		return (long)(num3/num2);//キャスト(voidとは)
	}
}