#include<iostream>
#include<string>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<stack>
#include<unordered_map>
#include<map>
#include<set>
#include<cstring>
#include<vector>
#include<numeric>
#include<queue>
#define Arr arr
#define null NULL
#define Endl endl
#define db double
#define pll pair<ll,ll>
#define vpll vector<pair<ll,ll> >
#define vll vector<ll>
#define vvpll vector<vector<pair<ll,ll> > >
#define vvll vector<vector<ll> >
#define privll priority_queue<ll, vector<ll> ,greater<ll> >
#define privpll priority_queue<pair<ll, ll>, vector<pair<ll,ll> > ,greater<pair<ll,ll> > >
#define ll long long
#define amonglr(x,l,r) x >= l && x <= r
#define rep(i,s,n) for(ll i = (s);i <= (n);i++)
#define per(i,s,n) for(ll i = (s);i >= (n);i--)
using namespace std;

const ll N = 2e6 + 10;
ll mod = 1e9 + 7, inf = 1e17;
string str, stt, stl[N];
ll m, t, k, n, num[N], arr[N];

ll qpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a;
        a = a * a;
        b >>= 1;
    }
    return res;
}

ll gcd(ll a, ll b) {
    return !b ? a : gcd(b, a % b);
}

void solve() {
    ll a, b;
    cin >> a >> b;
    ll temp = b, ans = 1e12, ans1 = 1e12;
    while (temp % 2 == 0) temp /= 2;
    while (temp % 5 == 0) temp /= 5;
    if (temp == 1) {
        cout << 0 << " " << 1 << Endl;
        return;
    }
    ll q1 = 1;
    for (int i = 0;; i++) {
        ll res = q1 * b, res1 = q1 * a;
        q1 = q1 * 2;
        if (res > 1e9) break;
        for (int j = 0;; j++) {
            res = res * 5;
            res1 = res1 * 5;
            if (res > 1e9) break;
            ll temp1 = res1 / temp * temp + temp - res1;
            ll gcd1 = gcd(temp1, res);
            ll temp2 = res / gcd1;
            temp1 /= gcd1;
            if (temp1 < ans) {
                ans = temp1;
                ans1 = temp2;
            }
        }
    }
    cout << ans << " " << ans1 << endl;
}

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