#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 7;
const int mod = 998244353;
#define int __int128
std::vector<int> vc;
void solve()
{
    ll a, b;
    cin >> a >> b;
    int aa = a,bb = b;
    ll c = 1e9, d = 1e9;
    for (auto x : vc)
    {
        int l = 0, r = min((int)1e9,x);
        auto check = [&](int mid)
        {
            double ab = 1.0 * a / b;
            double now = 1.0 * mid / x;
            if (now < ab)
                return false;
            else
                return true;
        };
        while (l < r)
        {
            int mid = l + r >> 1;
            if (check(mid))
                r = mid;
            else
                l = mid + 1;
        }

        // int lt = b * l, at = x * a;
        // int gf = b * x;
        // int tal = lt - at;
        // int gc = __gcd(gf, tal);
        // gf /= gc;
        // tal /= gc;
        // int bb = b;
        int gc = __gcd(bb,x);
        int gf = bb/gc*x;
        int tal = l * bb/gc - aa*x/gc;
        if (tal < c && gf <= 1e9 && gf >= 1)
        {
            c = tal, d = gf;
        }
    }
    if (c == 1e9 || c == 0)
    {
        cout << 0 << ' ' << 1 << '\n';
        return;
    }

    cout << c << ' ' << d << '\n';
}
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    for (int now = 1; now <= 1e15; now *= 2)
        for (int tmp = 1; tmp <= 1e15; tmp *= 5)
        {
            __int128 sum = tmp * now;
            if (sum > 1e15)
                continue;
            vc.push_back(now * tmp);
        }
    sort(vc.begin(), vc.end());
    ll _ = 1;
    cin >> _;
    while (_--)
        solve();
    return 0;
}