#include <bits/stdc++.h>
#define int long long

using namespace std;

constexpr int inf = 1E15;
constexpr int N = 1E9;

using i9 = __int128;

vector <int> f;
set <int> st;

i9 gcd (i9 x, i9 y) {
    return y == 0 ? x : gcd (y, x % y);
}

constexpr int mod = 1E6;

mt19937 rng (time (0));

void solve () {
    int a, b;
    cin >> a >> b;
    // int a = rng () % mod + 1, b = rng () % mod + 1;
    // int Gcd = gcd (a, b);
    // a /= Gcd;
    // b /= Gcd;
    // if (a > b) {
    //     swap (a, b);
    // }

    if (a == b || st.find (b) != st.end ()) {
        cout << 0 << " " << 1 << '\n';
        return;
    }

    int C = -1, D;
    for (auto x : f) {
        auto check = [&] (int t) {
            return i9(a) * x <= i9(b) * t;
        };
        int l = 1, r = inf;
        while (l < r) {
            int mid = (l + r) / 2;
            if (check (mid)) {
                r = mid;
            } else {
                l = mid + 1;
            }
        }
        i9 c = i9(l) * b - i9(a) * x;
        i9 d = i9(x) * b;
        i9 gc = gcd (c, d);
        c /= gc;
        d /= gc;
        if (d <= N && (C == -1 || C > c)) {
            C = c;
            D = d;
        }
    }

    cout << C << " " << D << '\n';
}

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

    for (i9 i = 1; i <= inf; i *= 2) {
        for (i9 j = i; j <= inf; j *= 5) {
            f.push_back (j);
            st.insert (j);
        }
    }

    int T = 1;
    cin >> T;

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

    return 0;
}