Baekjoon #2609

#include<bits/stdc++.h>

using namespace std;

int gcd(int a, int b) {
    if(b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b){
    return a / gcd(a, b) * b;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int a, b; cin >> a >> b;
    cout << gcd(a, b) << '\n' << lcm(a, b);

    return 0;
}

import sys

def input():
    return sys.stdin.readline().rstrip()

# 유클리드 호제법(Euclidean algorithm)
def gcd(num1, num2):
    if num2 == 0: return num1
    return gcd(num2, num1 % num2)

def lcm(num1, num2):
    return (num1 * num2) // gcd(num1, num2)

a, b = map(int, input().split())

g = gcd(a, b)
l = lcm(a, b)

print(g)
print(l)