#include <bits/stdc++.h>

#define ll long long


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

void solve(){
    int a, b;

    std::cin >> a >> b;
    std::vector<ll> num;

    if (b == 5 || b == 2){
        std::cout << "0 1\n";
        return;
    }

    constexpr int MAX = 1e6;

    for (ll i = 1; i <= MAX; i *= 2){
        for (ll j = 1; i * j <= MAX; j *= 5){
            for (ll k = 1; i * k * j <= MAX; k *= b){
                num.push_back(i * k * j);
            }
        }
    }

    std::sort(num.begin(), num.end());
    std::pair<ll, ll> ans = {1e18, 1e18};
    for (auto d : num){
        // std::cout << d << '\n';
        ll num1 = a * d;
        if (num1 % b == 0){
            ll by = b;
            ll t = d;

            while (t % b == 0){
                by *= b;
                t /= b;
            }
            
            auto get = [](ll a, ll b, ll m){
                ll x, y;
                ll d = exgcd(a, b, x, y);
                if (m % d){
                    return -1ll;
                }
                y = -y;
                while (x < 0 || y < 0) x += b / d, y += a / d;
                while (x >= b / d && y >= a / d) x -= b / d, y -= a / d;
                return x;
            };

            ll x = get(by, b, num1);
            if (x == -1) continue;
            by = x * by;
            by -= num1;
            by /= b;
            if (ans > std::make_pair(by, d) && by >= 0){
                ans = std::make_pair(by, d);
            }
        }
    }

    std::cout << ans.first << ' ' << ans.second << '\n';

}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;

    std::cin >> t;

    while (t--){
        solve();
    }

    return 0;
}