#include <bits/stdc++.h>
#define INF 1000000000
using namespace std;
using ll = long long;
int t, a, b, as1, as2;
namespace INV {
ll x, y;
void exgcd(int a, int b) {
    if (b == 0) {
        x = 1, y = 0;
        return;
    }
    exgcd(b, a % b);
    ll tx = x;
    x = y;
    y = tx - y * (a / b);
}

int inv(int v, int p) {
    exgcd(v, p);
    return (x % p + p) % p;
}
} // namespace INV
using INV::inv;

int gcd(int x, int y) {
    return y ? gcd(y, x % y) : x;
}

signed main() {
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
    int t0;
    cin >> t0;
    t = t0;
    vector<int> v1, v2, v;
    ll x = 1;
    while (x < INF) v1.push_back(x), x = x * 2;
    x = 1;
    while (x < INF) v2.push_back(x), x = x * 5;
    for (int x : v1) {
        for (int y : v2) {
            if (1ll * x * y <= INF) v.push_back(x * y);
        }
    }
    sort(v.begin(), v.end());
    while (t--) {
        int aa, bb;
        cin >> aa >> bb;
        as1 = INF, as2 = INF, a = aa, b = bb;
        if (a == 0) {
            cout << 0 << " " << 1 << '\n';
            continue;
        }
        for (int f : v) {
            int dd = gcd(f, b);
            if (1ll * f * b / dd > INF) continue;
            int bb = b / dd, ff = f / dd;
            // int d = f * bb;
            int c = (bb - 1ll * a * ff % bb) % bb, d = f * bb;
            if (c < as1) as1 = c, as2 = d;
        }
        cout << as1 << ' ' << as2 << '\n';
    }
}