#include <bits/stdc++.h>
using namespace std;

#define ll long long
const int mod = 1e9+7;
const int INF = 1e9;
const int N = 1e5+2;

ll exgcd(ll a, ll b, ll &x, ll &y) {
	if (b == 0) {
		x = 1;
		y = 0;
		return a;
	}
	ll d = exgcd(b, a%b, x, y);
	ll t = x;
	x = y;
	y = t-(a/b)*y;
	return d;
}

void solve() {
	ll ta, tb;
	cin>>ta>>tb;
	ll q = tb;
    ll t0 = 1;
	while (q%2 == 0) q /= 2, t0 *= 2;
	while (q%5 == 0) q /= 5, t0 *= 5;
	vector<ll> v2, v5;
	for (ll i = 1; i <= INF; i *= 2) {
		v2.push_back(i);
	}
	for (ll i = 1; i <= INF; i *= 5) {
		v5.push_back(i);
	}
	// ta*td + tb*tc = k*(tb0 * tb0)
	ll ans = 1e18, ansb = -1;
	for (auto vv2 : v2) {
		for (auto vv5 : v5) {
            if ((__int128)t0*vv2*vv5*q > INF) continue;
			if (vv2*vv5 > INF) continue;
			ll td = vv2*vv5*q;
			if (td > INF) continue;
			ll a = tb;
			ll b = q*q;
			ll c = -ta * td;
			ll x, y;
			ll d = exgcd(a, b, x, y);
			if (c%d) continue;
			a /= d, b /= d, c /= d;//同除公约数,不然遍历通解会有遗漏
			x *= c, y *= c;//得到ax+by=c的一组解
			x = (x%b + b)%b;
			y = (c-a*x)/b;
			// if (y > 0) continue;
			if (ans > x) {
				ans = x;
				ansb = td;
			}
		}
	}
	cout<<ans<<' '<<ansb<<'\n';
}	

int main()
{
	if (ifstream("test.in")) {
		freopen("test.in", "r", stdin);
		freopen("test.out", "w", stdout);
	}
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	cin>>T;
	while (T--) {
		solve();
	}
	return 0;
}