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

using namespace std;

int exgcd(int a, int b, int &x, int &y) {
    if (!b) {
        x = 1, y = 0;
        return a;
    }
    int d = exgcd(b, a % b, x, y);
    int t = x;
    x = y;
    y = t - a / b * y;
    return d;
}

int gcd(int a, int b) {
    if (!b) return a;
    return gcd(b, a % b);
}

int lcm(int a, int b) {
    return a / gcd(a, b) * b;
}

// bool getans(int cur2) {
//     int x, y;
//     exgcd()
// }

void solve() {
    int a, b;
    scanf("%lld%lld", &a, &b);
    int tmp = 1;
    int tb = b;
    while (tb % 2 == 0) {
        tb /= 2;
        tmp *= 2;
    }
    while (tb % 5 == 0) {
        tb /= 5;
        tmp *= 5;
    }
    // cerr << b << ' ' << tmp << '\n';
    int cur = 1;
    int ans = 1000000000, ans2 = 0;
    // int 
    auto getans = [&tb](int a, int d) -> int {
        int x, y;
        int g = exgcd(tb, d, x, y);
        y = -y;
        x *= a / g;
        y *= a / g;
        y %= tb / g;
        y += tb / g;
        y %= tb / g;
        return y;
    };
    for (int i = 0; i <= 20; ++i) {
        int cur2 = cur;
        for (int j = 0; j <= 20; ++j) {
            int L = lcm(cur2 * tb, b);
            int tmp2 = getans(a * L / b, L / (cur2 * tb));
            if (tmp2 < ans) {
                ans = tmp2;
                ans2 = cur2 * tb;
                // ans2 = cur2 * b / __gcd(tmp, cur2);
            }
            if (cur2 * tb > 1000000000) break;
            cur2 *= 5;
        }
        if (cur * tb > 1000000000) break;
        cur *= 2;
    }
    printf("%lld %lld\n", ans, ans2);
}

signed main() {
    int T;
    scanf("%lld", &T);
    while (T--) {
        solve();
    }
    return 0;
}