#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef __int128 i128;
i128 gcd(i128 a, i128 b)
{
	return b ? gcd(b, a % b) : a;
};
void solve()
{
	int a, b;
	scanf("%d%d", &a, &b);
	const ll limit = 1e15;
	pair<ll, ll> ans;
	ans.first = 1e18;

	auto work = [&](ll p)
	{
		bool flag = 0;
		// if (p == 2)
		// 	flag = 1;
		ll k = b - p % b * a % b;

		auto g = gcd(k, b);
		k /= g;
		auto d = b / g;

		g = gcd(k, p);
		k /= g;
		p /= g;
		d *= p;
		// if (flag)
		// 	cerr << "!!!" << (ll)k << ' ' << (ll)d << endl;
		if (d > 1e9)
			return;
		pair<ll, ll> t = make_pair(k, d);
		if (t < ans)
			ans = t;
	};
	for (ll i = 1; i <= limit; i <<= 1)
		for (ll j = 1; i * j <= limit; j = j * 5)
		{
			// cout << i << ' ' << j << endl;
			if (i * j == b)
				ans = {0, 1};
			work(i * j); 
		}
	printf("%lld %lld\n", ans.first, ans.second);
}
int main()
{
	int T;
	cin >> T;
	while (T--)
		solve();
}