#include <bits/stdc++.h>

using namespace std;

vector<int> k;

void Init() {
    int pre = 1;
    for (int i = 0; i <= 20; i++) {
        int pree = pre;
        for (int j = 0; j <= 9; j++) {
            if (pree > 1e6) {
                break;
            }
            k.push_back(pree);
            pree *= 5;
        }
        pre *= 2;
    }
    sort(k.begin(), k.end());
}

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

void solve() {
    int a, b;
    cin >> a >> b;
    int fb = f(b);
    if (fb == 1) {
        cout << "0 1\n";
        return;
    }
    int ans = INT_MAX;
    int d = 0;
    for (int p = 1; p * p <= fb; p++) {
        if (fb % p != 0) {
            continue;
        }
        if (fb / p - a > 0) {
            int kk = *((upper_bound(k.begin(), k.end(), fb / a / p)) - 1);
            int c = fb / p - a * kk;
            if (c < ans) {
                ans = c;
                d = kk * b;
            }
        }
        int tmp = fb / p;
        if (fb / tmp - a > 0) {
            int kk = *((upper_bound(k.begin(), k.end(), fb / a / tmp)) - 1);
            int c = fb / tmp - a * kk;
            if (c < ans) {
                ans = c;
                d = kk * b;
            }
        }
    }
    cout << ans << " " << d << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    Init();
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}