#include<bits/stdc++.h>
using namespace std;
#define int long long
int ttt;
int a,b;
int exgcd(int a,int b,int &x,int &y){
	if(b==0){
		x=1;
		y=0;
		return a;
	}
	return exgcd(b,a%b,y,x);
	y-=a/b*x;
}
int updiv(int a,int b) {
	return (a+b-1)/b;
}
int downdiv(int a,int b) {
	return a/b;
}
signed main() {
	cin>>ttt;
	while(ttt--) {
		cin>>a>>b;
		int ans_c=1000000000,ans_d=1000000000;
		int g=__gcd(a,b);
		a/=g;
		b/=g;
		int x=b;
		while(x%2==0) x/=2;
		while(x%5==0) x/=5;
		if(x==1) {
			cout<<"0 1"<<endl;
			continue;
		}
		for(int p2=1;x*p2<=1e9;p2*=2) {
			for(int p5=1;x*p2*p5<=1e9;p5*=5) {
				int d=x*p2*p5;
				int c,k;
				int g=exgcd(x,b/x,k,c);
				if((a*p2*p5)%g==0) {
					k*=(a*p2*p5)/g;
					c*=(a*p2*p5)/g;
					int dc=x/g,dk=(b/x)/g;
					if(c>=0) {
						int t=updiv(c,dc);
						c-=dc*t;
						k+=dk*t;
						if(c==0) {
							c-=dc;
							k+=dk;
						}
					}
					if(k<0) continue;
					int t=min(downdiv(-c,dc),downdiv(k,dk));
					
					c+=dc*t;
					k-=dk*t;
					if(c==0) {
						c-=dc;
						k+=dk;
					}
					int g_=__gcd(-c,d);
					if(-c/g_<ans_c) {
						ans_c=-c/g_;
						ans_d=d/g_;
					}
					else if((-c/g_==ans_c)&&(d/g_<ans_d)) {
						ans_c=-c/g_;
						ans_d=d/g_;
					}
				}
			}
		}
		cout<<ans_c<<' '<<ans_d<<endl;
	}
	return 0;
}
/*
4
1 2
2 3
3 7
19 79
*/