#include<stdio.h>

int GCD(int m,int n) { while(n!=0) { int temp = m%n; m = n; n = temp; } return(m); } int main() { int N; scanf("%d",&N); for(int i = 0;i<N;i++) { int n; int m; scanf("%d %d",&n,&m); int max = GCD(m,n); int min = m*n/max; printf("%d %d\n",max,min); } return 0; }

#include<stdio.h>
int main ()
{
    int n;
    scanf("%d",&n);
    while(n--)
       {
        int i,j;
        scanf("%d %d",&i,&j);
        int m=i,k=j;
        while(i!=j)
         {  
            if(i>j)
              {
                i=i-j;
              }
              else
              {
                 j=j-i;
              }
         }
         printf("%d %d\n",i,m*k/i);//i*j==最大公约数*最小公倍数
       }
    return 0;

}

//理解一下更相减损法
#include<stdio.h>
int main()
{
    int a,b,t,n;
	int x,y;
	scanf("%d",&n);
	while(n--){
		scanf("%d %d",&a,&b);
		x=a,y=b;
		while(x!=y){
			if(x<y)       	
			t=x,x=y,y=t;
			x-=y;
			}
		printf("%d %d\n",x,(a*b)/x);			
	}
	return 0;
}