#include <bits/stdc++.h>

#define ll long long


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

void solve(){
	int a, b;

	std::cin >> a >> b;
	std::vector<ll> num;

	if (b == 5 || b == 2){
		std::cout << "0 1\n";
		return;
	}

	constexpr int MAX = 1e6;

	for (ll i = 1; i <= MAX; i *= 2){
		for (ll j = 1; i * j <= MAX; j *= 5){
			for (ll k = 1; i * k * j <= MAX; k *= b){
				num.push_back(i * k * j);
			}
		}
	}

	std::sort(num.begin(), num.end());
	std::pair<ll, ll> ans = {1e18, 1e18};
	for (auto d : num){
		// std::cout << d << '\n';
		ll num1 = a * d;
		if (num1 % b == 0){
			ll by = b;
			ll t = d;

			while (t % b == 0){
				by *= b;
				t /= b;
			}
			ll add = by;
			
			ll x, y;
			if (num1 % std::gcd(by, b)){
				continue;
			}

			ll dd = exgcd(by, b, x, y);
			y = -y;
			while (x < 0 || y < 0){
				x += b / dd;
				y += by / dd;
			}
			while (x >= b / dd && y >= by / dd){
				x -= b / dd, y -= by / dd;
			}
			by = x * by;
			by -= num1;
			by /= b;
			if (ans > std::make_pair(by, d) && by >= 0){
				ans = std::make_pair(by, d);
			}
		}
	}

	std::cout << ans.first << ' ' << ans.second << '\n';

}

int main(){
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int t;

	std::cin >> t;

	while (t--){
		solve();
	}

	return 0;
}