#include<iostream>
using namespace std;
//编写函数求GCD和LCM
int GCD(int a,int b){
if(b == 0){
return a;
}
return GCD(b,a%b);
}
int LCM(int a,int b){
for(int i=1;i<=ab;i++){
if(ai%b==0){
return a*i;
}
}
}
int main(){
int a,b;
cin>>a>>b;
cout<<"GCD="<<GCD(a,b)<<endl;
cout<<"LCM="<<LCM(a,b)<<endl;
}
//Greatest Common Divisor(GCD最大公约数)
//Least Common Multiple(LCM最小公倍数)
