#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
//lg2=30
//log5=19
ll gcd(ll a,ll b){
	if(b==0)return a;
	else return gcd(b,a%b);
}
ll ksm(ll x,ll y)
{
	ll ans=1;
	while(y)
	{
		if(y&1)
		ans*=x;
		x*=x;
		y>>=1;
	}
	return ans;
}
void solve(){
	ll c=1e18;
	ll a,b;
	ll fenmu=0;
	scanf("%lld %lld",&a,&b);
	ll u,f;
	u=f=LONG_MAX;
	__int128 two=1;
	for(ll i=0;i<=30;i++){
		__int128 five=1;
		for(ll j=0;j<=13;j++){
			__int128 ko;
			ko=(__int128)max(a,b)*(__int128)two*(__int128)five;
			if(ko>1e18)
			break;
			five*=5;
			ll tem=a*(1<<i)*five;
		    ll m;
			if(tem<=b)
			m=(b/tem);
			else 
			m=(tem/b)+(tem%b>0);
				c = m*b-tem;
				fenmu=b*(1<<i)*five;
				ll k=gcd(c,fenmu);
				if(fenmu/k>(ll)1e9)
				continue;
				if(u>c/k)
				u=c/k,f=fenmu/k;
				else if(u==c/k)
				f=min(f,fenmu/k);
				else 
				continue;
		}
		two=two*2;
		if(two>=1e18)
		break;
	}
	cout<<(ll)u<<" "<<(ll)f<<"\n";
}

int main(){
	ll t;
	cin>>t;
	while(t--){
		solve();
	}
	
	
	return 0;
}
/*

10
2 35
*/