#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll INF = 1e9;

ll a, b, c, d;
set <ll> vis;

void dfs(ll s) {
    if (vis.find(s) != vis.end()) return ;
    vis.insert(s);
    ll g = __gcd(s, b);
    ll x = b / g * s;
    if (x > INF) return ;
    ll tmp = s / g * a;
    ll t = (tmp - 1) / (b / g) + 1;
    ll c_ = b / g * t - tmp, y = __gcd(c_, x);
    assert(c_ >= 0);
    if (c_ / y < c) {
        c = c_ / y;
        d = x / y;
    }
    dfs(s << 1);
    dfs(s * 5);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    
    int T;
    cin >> T;
    while (T --) {
        cin >> a >> b;
        c = 1e18;
        vis.clear();
        dfs(1);
        cout << c << ' ' << d << '\n';
    }
    return 0;
}