import java.util.*;
import java.util.Arrays;
public class GcdLcm{
    public static int gcd(int x,int y){
        int t;
        while(y!=0){
          t=x%y;
          x=y;
          y=t;
        }
        return x;
    }  
    public static int lcm(int x,int y){
        return (x*y)/gcd(x,y);
    }      
    public static void main(String args []){
        int a=Integer.parseInt(args[0]);
        int b=Integer.parseInt(args[1]);
        System.out.println("最大公约数是:"+gcd(a,b));
        System.out.println("最小公倍数是:"+lcm(a,b));
    }      
}
    
    
    
}