#include <bits/stdc++.h>
using namespace std;
#define int long long

array<int, 3> exgcd(int a, int b, array<int, 4> x = {1, 0, 0, 1}) {
    for (int c; b; tie(a, b) = pair(b, a % b)) {
        c = a / b, x = {x[2], x[3], x[0] - x[2] * c, x[1] - x[3] * c};
    }
    return {x[0], x[1], a};
}

array<int, 3> LiEu(int a, int b, int n = 1, int t = 0) {
    auto [x, y, d] = exgcd(a, b);
    if (n % d) return {x, y, 0};
    t = abs(b) / d, x = ((n / d * x) % t + t) % t;
    return {x, (n - a * x) / b, d};
}

void QAQ() {
    int a, b;
    cin >> a >> b;

    int ta = a, tb = b;
    int d = __gcd(a, b);
    a /= d, b /= d;

    int cnt2 = 0, cnt5 = 0;

    for ( ; ; ) {
        if (ta % 2 && ta % 5) break;
        cnt2 += ta % 2 == 0;
        cnt5 += ta % 5 == 0;
        if (ta % 2 == 0) ta /= 2;
        if (ta % 5 == 0) ta /= 5;
    }

    for ( ; ; ) {
        if (tb % 2 && tb % 5) break;
        cnt2 -= tb % 2 == 0;
        cnt5 -= tb % 5 == 0;
        if (tb % 2 == 0) tb /= 2;
        if (tb % 5 == 0) tb /= 5;
    }

    array<int, 2> ans = {numeric_limits<int>::max(), -1};

    for (int now = 1; now <= 1000000000; now <<= 1) {
        for (int t = now; t <= 1000000000; t *= 5) {
            int d = t * tb;
            if (d > 1000000000) continue;
            int gd = __gcd(d, b);

            auto [c, tt, _] = LiEu(b, -tb * d, -a * d);

            int tmp = (tb * d) / _;

            if (d == 60) {
                cerr << c << " \n";
            }

            if (c >= 0 && c < ans[0]) {
                ans = {c, d};
            } 
        }
    }

    cout << ans[0] << " " << ans[1] << "\n";
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1;
    cin >> t;

    for (cout << fixed << setprecision(12); t--; QAQ());
}