import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
while(in.hasNext()){
int a = in.nextInt();
int b = in.nextInt();
for(int k=a>b?a:b ;;k++){
if(k%a==0 && k%b==0){
System.out.println(k);
break;
}
}
}
}
}
//使用辗转相除法,先求最大公约数,再求最小公倍数 m/gcd(m,n)*n
<pre name="code" class="java">import java.util.Arrays;
import java.util.Scanner;
public class Main {
public static int gcd (int m,int n){
if(m<n){
int a = m; m=n;n=a;
}
if(m%n==0){
return n;
}
else
return gcd(n,m%n);
}
public static int lcm(int m,int n){
return m/gcd(m,n)*n;
}
public static void main(String[] args) {
Scanner in=new Scanner(System.in);
while(in.hasNext()){
int a = in.nextInt();
int b = in.nextInt();
System.out.println(lcm(a,b));
}
}
}