#include <iostream>

using namespace std;

int GCD(int a, int b) {//最大公约数
    if (b == 0)
        return a;
    else
        return GCD(b, a % b);
}

int LCM(int a, int b) {//最小公倍数 ----> a*b=GCD(a,b)*LCM(a,b)
    return (a * b) / GCD(a, b);
}

int main() {
    int m, n;
    while (cin >> m >> n) {
        cout << GCD(m, n) << ' ' << LCM(m, n) << endl;
    }
    return 0;
}