#include<bits/stdc++.h>
using namespace std;
int gcd(int a,int b){//最大公约数
if(a<b) swap(a,b);
if(a%b==0) return b;
else return gcd(b,a%b);
}
int lcm(int a,int b){//最小公倍数
return (a*b/gcd(a,b));
}
int main(){
int n,m;
cin>>n>>m;
int large,least;
large=gcd(n,m);
least=lcm(n,m);
cout<<"large="<<large<<","<<"least="<<least;
return 0;
}