#include<random>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<ctime>
#include<cctype>
#include<cstdio>
#include<cstdlib>
#include<climits>
//#define NDEBUG
#include<cassert>
#include<cstring>
#include<complex>
#include<algorithm>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<vector>
#include<bitset>
//#define LL __int128
#define LL long long
#define ULL unsigned LL
#define uint unsigned int
//#define int LL
//#define double long double
#define mkp make_pair
#define par pair<int,int>
#define psb push_back
#define epb emplace_back
#define f(x) ((x).first)
#define s(x) ((x).second)
using namespace std;
#define Lbt(x) ((x)&(-(x)))
#define Swap(x,y) (x^=y^=x^=y)
const int Mxxx=1e5;
inline char gc()
{
//	return getchar();
	static char buf[Mxxx],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,Mxxx,stdin),p1==p2)?EOF:*p1++;
}
inline char pc(char ch,bool fl=false)
{
//	return fl?0:putchar(ch),0;
	static char buf[Mxxx],*p1=buf,*p2=buf+Mxxx;
	return (fl||((*p1++=ch)&&p1==p2))&&(fwrite(buf,1,p1-buf,stdout),p1=buf),0;
}
#define output pc('!',true)
inline int read()
{
	char ch=gc();
	int gans=0,gflag=0;
	for(;ch<'0'||'9'<ch;gflag|=ch=='-',ch=gc());
	for(;'0'<=ch&&ch<='9';gans=(gans<<1)+(gans<<3)+(ch^48),ch=gc());
	return gflag?-gans:gans;
}
template<typename T>
inline char read(T&gans)
{
	char ch=gc();
	int gflag=0;gans=0;
	for(;ch<'0'||'9'<ch;gflag|=ch=='-',ch=gc());
	for(;'0'<=ch&&ch<='9';gans=(gans<<1)+(gans<<3)+(ch^48),ch=gc());
	return gans=gflag?-gans:gans,ch;
}
template<typename T>
inline void write(T x)
{
	if(x>9)write(x/10);
	pc(x%10^48);
}
template<typename T>
inline void writenum(T x,char ch)
{
	if(x<0)pc('-'),x=-x;
	write(x);pc(ch);
}
inline void writechar(char x,char ch)
{
	pc(x);pc(ch);
}
template<typename T>
inline T Max(T x,T y)
{
	return x>y?x:y;
}
template<typename T>
inline T Min(T x,T y)
{
	return x<y?x:y;
}
template<typename T>
inline T Abs(T x)
{
	return x<0?-x:x;
}
template<typename T>
inline void ckmx(T&x,T y)
{
	x=Max(x,y);
}
template<typename T>
inline void ckmn(T&x,T y)
{
	x=Min(x,y);
}
int TT,ansa,ansb;
//inline LL Gcd(LL x,LL y){return !y?x:Gcd(y,x%y);}
signed main()
{
	#ifndef ONLINE_JUDGE
	freopen("_.in","r",stdin);
//	freopen("_.out","w",stdout);
	#endif
	int a,b,x,y,s,v,nw;
	for(TT=read();TT;TT--)
	{
		a=read();b=read();
//		int tpa=a,tpb=b;
		for(;!(b&1);b>>=1);
		for(;!(b%5);b/=5);
		if(!(a%=b)){writenum(0,32);writenum(1,10);continue;}
//		cout<<"CK?:"<<a<<" "<<b<<"\n";
		for(x=0,ansa=s=b-a,ansb=nw=b;nw<=1e9;nw<<=1,s<<=1,x++)for(LL vl=(y=0,v=s,nw);vl<=1e9;vl*=5,v*=5,y++)if((v%b)<ansa)
//		cout<<"Cng:"<<ansa<<" "<<ansb<<"\n",
		ansa=v%b,ansb=vl
//		,cout<<"Cng:"<<ansa<<" "<<ansb<<"\n"
		;
		writenum(ansa,32);writenum(ansb,10);
//		LL g=Gcd(tpb,ansb),tpd=(LL)tpb*ansb/g,tpc=(LL)tpa*ansb/g+(LL)tpb*ansa/g;
//		g=Gcd(tpc,tpd);for(tpd/=g;!(tpd&1);tpd>>=1);for(;!(tpd%5);tpd/=5);
//		assert(tpd==1);
	}
	return output;
}
/*
1 1 2
*/
/*
1 2 3
*/
/*
4
1 2
2 3
3 7
19 79
*/