#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
vector<ll> V;

const int inf = 1e9;

namespace INV {
ll x, y;
void exgcd(int a, int b) {
    if (b == 0) {
        x = 1, y = 0;
        return;
    }
    exgcd(b, a % b);
    ll tx = x;
    x = y;
    y = tx - y * (a / b);
}

int inv(int x, int p) {
    exgcd(x, p);
    return (x % p + p) % p;
}
} // namespace INV
using INV::inv;

void solve() {
    int a, b;
    cin >> a >> b;
    int T = 1;
    while (b % 2 == 0) T *= 2, b /= 2;
    while (b % 5 == 0) T *= 5, b /= 5;
    int as1 = inf, as2 = inf;
    int iT = inv(T, b);
    for (const ll v : V) {
        if (b * v > inf) continue;
        int d = b * v;
        int c = (b - a * v % b * iT % b) % b;
        if (c < as1) as1 = c, as2 = d;
    }

    cout << as1 << " " << as2 << '\n';
}

int main() {
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
    int t;
    cin >> t;
    {
        vector<int> v1;
        vector<int> v2;
        ll x = 1;
        while (x < inf) v1.push_back(x), x *= 2;
        x = 1;
        while (x < inf) v2.push_back(x), x *= 5;
        for (int x : v1)
            for (int y : v2)
                if (1ll * x * y <= inf) V.push_back(x * y);
    }
    while (t--) solve();
}