/*
	Calculation LCM of two Integers
	Author: md. moniruzzaman
*/

#include<stdio.h>

int gcd( int a, int b) { return b ? gcd(b,a%b) : a ; }

int LCM(int a, int b) {
	/*
		as we know lcm = (a*b) / gcd(a,b)
		Another good approch to calculate lcm by prime factorization
	*/
	int ggcd, lcm;
	ggcd = gcd(a,b);
	lcm = (a*b)/ggcd;
	return lcm;
}

void main() {
	int n, m;
	scanf("%d%d",&n,&m);
	printf("%d\n",LCM(n,m));
}