#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;

ll ansc=1e18,ansd=0;
ll a,b;
ll x,y;
ll exgcd(ll a,ll b,ll&x,ll &y){
	if(!b){
		x=1;y=0;
		return a;
	}
	ll g=exgcd(b,a%b,x,y);
	ll t=x;
	x=y;
	y=t-(a/b)*y;
	return g;
}
void solv(ll z){
	ll q,c;
	ll az=a*z;
	ll g=exgcd(x,y,q,c);
	// cout<<z<<" "<<y<<" "<<q<<" "<<c<<"\n";
	if(c>0){
		ll tmp=c/(x/g)+1;
		c=c-tmp*(x/g);
		// q=q+tmp*(y/g);
	}
	c=-c;
	c=c*((__int128)a*z/g);
	if(1){
		ll tmp=c/(x/g);
		c=c-tmp*(x/g);
		// q=q+tmp*(y/g);
	}
	// cout<<a*z<<"\n";
	if(c<ansc){
		// cout<<c<<" "<<x*z<<"\n";
		ansc=c;
		ansd=x*z;
	}
}
//q*x-c*y=a*z
void solve(){
   	ansc=1e18,ansd=0;
    cin>>a>>b;
    ll now2=1,tmp=b;
    while(tmp%2==0)tmp>>=1;
    while(tmp%5==0)tmp/=5;
	x=tmp;y=b/tmp;
    if(tmp==1){
        cout<<"0 1\n";
        return;
    }
    while(1){
        ll now5=1;
        while(1){
			solv(now2*now5);
            now5*=5;
            if(now5*now2*b>1e9)break;
        }
        now2*=2;
        if(now2*b>1e9)break;
    }
    cout<<ansc<<" "<<ansd<<"\n";
}
int main(){
    ios::sync_with_stdio(0),cin.tie(0);
    int t=1;
    cin>>t;
    while(t--)solve();
    return 0;
}