#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ULL;
typedef long long LL;
typedef pair<int,int> PII;
#define int long long
const int N = 1010;

map<int,int> mp;
int q[N],tot;

void dfs(int x)
{
	if(x>1e9) return ;
	if(!mp[x])
	{
		q[++tot]=x;
		mp[x]=true;
		dfs(x*2);
		dfs(x*5);
	}
}
void exgcd(int a,int b,int &x,int &y)
{
	if(!b)
	{
		x=1,y=0;
		return ;
	}
	exgcd(b,a%b,x,y);
	int t=x;
	x=y;
	y=t-(a/b)*y;
	return ;
}
void solve()
{
	int a,b;
	cin>>a>>b;
	int B=b;
	while(B%2==0) B/=2;
	while(B%5==0) B/=5;
	if(B==1)
	{
		cout<<"0 1\n";
		return ;
	}
	int ans1=b-a,ans2=b,w=b/B;
	for(int i=1;i<=tot && q[i]*B<=1e9;i++)
	{
		int d=q[i]*B;
		int y=B-(q[i]*a%B),xinv,k;
		exgcd(w,B,xinv,k);
		xinv=(xinv%B+B)%B;
		int c=xinv*y%B;
		if(ans1>c)
		{
			ans1=c;
			ans2=d;
		}
	}
	cout<<ans1<<' '<<ans2<<'\n';
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	dfs(2);
	dfs(5);
	sort(q+1,q+1+tot);
	int t;
	cin>>t;
	while(t--)	
		solve();
	return 0;
}