1012 最小公倍数LCM

import java.util.Scanner;
public class Main {
    static long gcd(long a,long b){
        return a%b==0? b:gcd(b,a%b);
    }
    static long LCM(long a,long b){
        return a*b/gcd(a,b);
    }

    public static void main(String[] args) {
        // TODO Auto-generated method stub
        Scanner sc=new Scanner(System.in);
        while(sc.hasNext()){
            long a=sc.nextLong();
            long b=sc.nextLong();
            System.out.println(LCM(a,b));
            
        }
        sc.close();


    }

}