#include<bits/stdc++.h>
#include<map>
#include<queue>
#include<set>
#include<vector>
#define int long long
#define ull unsigned long long
#define endl '\n'
#define all(s) s.begin(),s.end()
#define xx first
#define yy second
#define inf 0x3f3f3f3f3f3f3f3f
#define N 1000005
#define mod 1000000007//998244353
#define double long double
#define lowbit(x) ((x)&(-x))
//#define ll long long
#define ls(x) (x<<1)
#define rs(x) ((x<<1)|1)
#define pll pair<int,int> 
#define __lcm(a,b) (a/__gcd(a,b)*b)
const double pi=acos(-1);
const int P=233333;
const int PP=1313131;
const int mod1=1000001011;
const int mod2=(1ll<<31)-1;
using namespace std;
int qmi(int b,int k)
{
	int ans=1;
	while(k)
	{
		if(k&1) ans*=b;
		b*=b,k>>=1;
	}
	return ans;
}
vector<int> v;
void init(int n)
{
	//int cnt=0;
	for(int i=0;i<=20;i++)
	{
		for(int j=0;j<=10&&qmi(2,i)*qmi(5,j)<=n;j++)
		{
			int x=qmi(2,i)*qmi(5,j);
			v.push_back(x);
			//cout<<++cnt<<" "<<qmi(2,i)*qmi(5,j)<<endl;
		}
	}
	sort(all(v));
} 
bool check(int x)
{
	while(x%2==0) x/=2;
	while(x%5==0) x/=5;
	return x==1;
}
bool query(int a,int b,int c,int d)
{
	int n=b*d;
	a*=d,c*=b;
	int m=a+c;
	int g=__gcd(n,m);
	n/=g,m/=g;
	if(check(n)) cout<<m<<" "<<n<<endl;
	return check(n);
}
int arr[N];
void solve()
{
	int a,b;cin>>a>>b;
	/*for(int i=1;i<=1000000;i++)
	{
		if(query(a,b,1,i))
		{
			cout<<i<<endl;
			return ;
		}
	}*/
	int ans=b-a,id=b;
	for(auto i:v)
	{
		int g=__gcd(b,i);
		double x=a*i/g;
		int k=ceil(x/b*g)*b/g;
		if(k-x<ans)
		{
			ans=k-x;
			id=i*b/g;
		}
	}
	cout<<ans<<" "<<id<<endl;
}
void gettest(int t,int T)
{
	
}
signed main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int T=1;
	cin>>T;
	init(1000000);
    if(T==-1)
    {
    	gettest(209,T);
    	return 0;
	}
	while(T--)
    {
    	solve();
    	//cout<<"&\n";
	}
    return 0;
}
/*
4
1 2
2 3
3 7
19 79

1
28 53

1
17 60

1
2 35


*/