Problem:
Score : 300 points

Problem Statement

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.

Sample Input 1

2 3

Sample Output 1

6

When we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.

Sample Input 2

123 456

Sample Output 2

18696

Sample Input 3

100000 99999

Sample Output 3

9999900000

Solution in C (GCC 5.4.1) (judge verdict: Runtime Error)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int main(void) {

	long long int A=0,B=0,q=0,r=0,temp=0,g=1,x=0;
	scanf("%d %d", &A, &B);

	if(B>A){
	 temp = A;
	 A = B;
	 B= temp;
	}

	r=A % B;
	q=B;

	switch(r){
	case 0:x=A;break;
	case 1:x=A*B/g;break;
	default:
		while(r!=1 && r !=0){
		g = r;
		r = q % r;
		q = g;
	}
		g=r;
		x=A*B/g;
	}

	printf("%lld", x);
	return 0;
}