#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+10,mod=998244353;
int a[N],tot;
void dfs(int u)
{
	if(u>1e6)return;
	a[++tot]=u;
	dfs(2*u);
	dfs(5*u);
}
void solve() {
	int x,y;
	cin >> x >> y;
	x = x % y;
	bool ok=0;
	for(int i=1;i<=tot;i++)if(y==a[i])ok=1;
	if(ok)
	{
		cout << 0 << " " << 1 << endl;
		return ;
	}
	vector<pair<int,int>>res;
	for(int i=1;i<=tot;i++)
	{
		int cnt=(a[i]*x-1)/y+1;
		int c=y*cnt-a[i]*x,d=a[i]*y;
		//acout<<a[i]<<' '<<c<<' '<<d<<endl;
		int gcd=__gcd(c,d);
		c/=gcd,d/=gcd;
		//cout<<a[i]<<' '<<c<<' '<<d<<endl;
		res.push_back({c,d});
	}
	sort(res.begin(),res.end());
	cout<<res[0].first<<' '<<res[0].second<<endl;
}
signed main(void) {
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	dfs(1);
	sort(a+1,a+1+tot);
	tot=unique(a+1,a+1+tot)-a-1;
	//for(int i=1;i<=tot;i++)cout<<a[i]<<' ';cout<<endl;
	int t= 1;
	cin >> t ;
	while(t -- ) {
		solve();
	}
}