#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int zzz(long long a, long long b)
{
	long long c;
	long long max,min;
	max = a <= b ? b : a;
	min = a > b ? b : a;
	while (max-min != 0)
	{
		c = max - min;
		max = c <= min ? min : c;
		min = c > min ? min : c;
	}
	return min;
}
int main()
{
	long long n;scanf("%d",&n);
	for (int i=1;i<=n;i++){
		long long x,y,gg,num;
		scanf("%d%d",&x,&y);
		num=zzz(x,y);///num最大公约数 
		gg = x * y / num;//gg最小公倍数
		if (x==y){
			printf("1 1");
		} else{
			int aaa=1;
			printf("%d %d",aaa,gg/num);
		}
		if(i!=n){
			printf("\n");
		}	
	}
}