#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return !y ? x : gcd(y, x % y); }
void calc(ll a, ll b, ll pw_10, ll &c, ll &d) {
c = b * ((a * pw_10 + b - 1) / b) - pw_10 * a;
d = pw_10 * b;
ll g = gcd(c, d);
c /= g;
d /= g;
}
void solve() {
ll a, b, c = 1, d = 1, c_mn = 1e18, d_mn = 1e18;
scanf("%lld%lld", &a, &b);
ll pw_10 = 1;
for (int i = 0; i <= 12; i++) {
calc(a, b, pw_10, c, d);
printf("pw_10 = %lld: %lld %lld\n", pw_10, c, d);
if (c < c_mn) {
c_mn = c;
d_mn = d;
}
pw_10 *= 10;
}
printf("%lld %lld\n", c_mn, d_mn);
}
int main() {
int T = 0;
scanf("%d", &T);
while (T--) solve();
return 0;
}