#求最大公约数，求最小公倍数
n= int(input())
m= int(input())

x = min(m,n)
y = 1
z = 0
for i in range(1,x+1):
if m%i==0 and n%i==0:
    y=i

for i in range(max(m,n),m*n+1):
if i%m==0 and i%n==0:
    z=i
    break
print("最大公约数是：",y)

print("最小公倍数是：",z)

for i in range(2,1001):
    for j in range(1,i):
        if i%j == 0:
            s=s+j
if s==i:
    print(i)