#include<stdio.h>
#include<string.h>
typedef __int128_t lll;
typedef __uint128_t ulll;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int word;
typedef unsigned char byte;
word case_,n;
word bef[1<<20],nxt[1<<20];
struct READ{
	char c;
	inline READ(){
		bef[1]=1,nxt[1]=0;
		for(word i=2;i<(1<<20);++i) if(bef[i]==0){
			for(word j=1,before=0;j;j=nxt[j])
				if(1ull*j*i<(1<<20)){
					nxt[j*i]=nxt[j],nxt[j]=j*i;
					bef[j*i]=i,before=j;
				}else nxt[before]=nxt[j];
		}
		c=getchar();}
	template<typename type>
	inline READ& operator>>(type &num){
		while('0'>c||c>'9') c=getchar();
		for(num=0;'0'<=c&&c<='9';c=getchar())
			num=num*10+(c-'0');
		return *this;
	}
}cin;
word a,b,p;
struct GCD{
	ll gcd,x,y;
	inline GCD(){}
	inline GCD(const GCD &)=default;
	inline GCD(const ll g,const ll X,const ll Y):
		gcd(g),x(X),y(Y){}
};
inline GCD exgcd(const ll a,const ll b){
	if(b==0) return GCD(a,1,0);
	const GCD gcd=exgcd(b,a%b);
	return GCD(gcd.gcd,gcd.y,gcd.x-(a/b)*gcd.y);
}
ll minc,mind;
inline void getans(const word d0,const ll a0,const ll d){
	GCD g=exgcd(d0,p);
	ull c=1ull*(d0-(g.y%d0))*(a0%d0)%d0;
	if(minc>c) minc=c,mind=d;
}
inline void dfs2(const word d0,ll a0,ll d){
	while(getans(d0,a0,d),((ulll(a0)<<1)>>63)==0
		&&((ulll(d)<<1)>>63)==0) a0<<=1,d<<=1;
}
inline void dfs5(const word d0,ll a0,ll d){
	while(dfs2(d0,a0,d),((ulll(a0)*5)>>63)==0
		&&((ulll(d)*5)>>63)==0) a0*=5,d*=5;
}
inline void dfs(word step,word now=1){
	if(step==1){
		if(a%(b/now)==0) dfs5(now,a/(b/now),now);
		return;
	}
	word p=bef[step],cnt=0;
	while(step%p==0) ++cnt,step/=p;
	for(word i=0;i<=cnt;++i,now*=p)
		dfs(step,now);
}
int main(){
	for(cin>>case_;case_;--case_){
		cin>>a>>b,p=1;
		while(b%2==0) b/=2,p*=2;
		while(b%5==0) b/=5,p*=5;
		minc=b-a,mind=b,dfs(b);
		printf("%lld %lld\n",minc,mind);
	}
	return 0;
}