#include <stdio.h>
int gcd(int a, int b) {
while (b!= 0) {
int temp = b;
b = a % b;
a = temp;
}
return a;
}
int lcm(int a, int b) {
return a * b / gcd(a, b);
}
int main() {
int num1, num2;
scanf("%d %d", &num1, &num2);
printf("最大公约数是%d\n最小公倍数是%d\n", gcd(num1, num2), lcm(num1, num2));
return 0;
}
