#include<iostream>
#include<cmath>
using namespace std;
int main()
{
int m,n,gbs,gys;
while (cin >> m >> n)
{
for (gbs = m; gbs % n != 0; gbs = gbs + m); //当最小公倍数无法整除n时,公倍数自增m
gys = m * n / gbs; //最大公因数 = 两数之积 / 最小公倍数
cout << "最小公倍数为:" << gbs << endl;
cout << "最大公因数为:" << gys << endl;
}
system("pause");
return 0;
}