import java.util.*;
public class gcd{public static void main(String args[]) {
int a,b;
Scanner cin = new Scanner(System.in);
while(cin.hasNext()){ //输入多组数据
a = cin.nextInt();
b = cin.nextInt();
System.out.printf("%d,%d\n",GCD(a,b),a*b/GCD(a,b)); //最大公约数等于俩个数相乘除以最小公倍数
}
}
if(b == 0) return a;
else return GCD(b,a%b);
}
}