#include <bits/stdc++.h>
#define FL(i, a, b) for (ll i = (a); i <= (b); ++i)
#define FR(i, a, b) for (ll i = (a); i >= (b); --i)
#define fi first
#define se second
#define eb emplace_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
constexpr ll V = 1e12;
ll Exgcd(ll &x, ll &y, ll a, ll b) {
	if(!b) {
		x = 1, y = 0;
		return a;
	}
	ll g = Exgcd(x, y, b, a % b), t = x;
	x = y;
	y = t - a / b * y;
	return g;
}
void Solve() {
	ll a, b, _b, t = 1;
	scanf("%lld %lld", &a, &b);
	pll ans = {b - a, b};
	// cout << ans.fi << ' ' << ans.se << endl;
	_b = b;
	for ( ; b % 2 == 0; b /= 2, t *= 2);
	for ( ; b % 5 == 0; b /= 5, t *= 5);
	auto ModB = [&](ll x) {
		return (x % b + b) % b;
	};
	ll x, y;
	Exgcd(x, y, t, b);
	// cout << x << ' ' << y << ' ' << t << ' ' << b << endl;
	for (ll i = b; i <= V; i *= 2) {
		for (ll j = i; j <= V; j *= 5) {
			ans = min(ans, {ModB(-a * (j / b) * x), j});
		}
	}
	printf("%lld %lld\n", ans.fi, ans.se);
}
int main() {
	int T;
	scanf("%d", &T);
	while (T--) {
		Solve();
	}
	return 0;
}