#include <bits/stdc++.h>

#define DEBUG
#ifdef DEBUG
#define debug(x) cerr << #x << ": " << (x) << endl
#define print(x) cerr << x << ' '
#define println(x) cerr << x << endl
#else
#define debug(x)
#define print(x)
#define println(x)
#endif
#define x first
#define y second
#define el '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int N = 3e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

int gao(int x) {
    while (x % 2 == 0) x /= 2;
    while (x % 5 == 0) x /= 5;
    return x;
}

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

void solve() {
    int a, b; cin >> a >> b;
    if (gao(b) == 1) return cout << "0 1" << el, void();
    int c = b - a, d = b;
    vector<int> nums;
    static constexpr int N = 1000000000;
    for (ll x = 1; x <= N; x *= 2) 
        for (ll y = 1; x * y <= N; y *= 5) 
            nums.emplace_back(x * y);
    for (ll k: nums) {
        if (k == 1) continue;
        if (b % k == 0) {
            auto wk = [&]() -> void {
                ll p = gao(b);
                ll x, y;
                ll g = exgcd(p, k, x, y);
                if (a % g) return;
                ll A = a, P = p, K = k;
                A /= g, P /= g, K /= g, x *= a, y *= a;
                ll t = y / P;
                y -= t * P;
                if (y > 0) y -= P;
                ll res = -y;
                if (res < c) c = res, d = b / k;
            };
        }
        if (b * k <= N) {
            ll p = gao(b);
            // if (b * k == 4375) debug(p); debug(k); debug(a);
            ll x = (a * k + p - 1) / p;
            ll res = p * x - a * k;
            if (res < c) c = res, d = b * k;
        }
    }
    cout << c << ' ' << d << el;
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int tcase = 1;
    cin >> tcase;
    while (tcase--) solve();
}