#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using i128 = __int128_t;

#define ff first 
#define ss second 
#define all(x) x.begin(),x.end()

#ifdef LOCAL 
#include "../debug.h"
#else
#define debug(...) do {} while(false)
#endif

const int maxn = 1e5 + 10;
const int lim = 1e9;

int tot, all[maxn];

void init()
{
    for (int i = 0; i <= 32; i++)
    {
        ll now = 1;
        for (int j = 0; j < i; j++)
            now = now * 2;
        for (int j = 0; now <= lim; j++)
        {
            all[++tot] = now;
            now = now * 5;
        }
    }
    sort(all + 1, all + tot + 1);
}

inline ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); }

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

ll inv(ll x, ll p)
{
    ll u, v;
    exgcd(x, p, u, v);
    u %= p, u += p, u %= p;
    return u;
}

bool check2(ll x)
{
    while (x % 2 == 0)
        x /= 2;
    while (x % 5 == 0)
        x /= 5;
    return x == 1;
}

bool check(ll a, ll b, ll c, ll d)
{
    ll x = a * d + b * c;
    ll y = b * d;
    ll dd = gcd(x, y);
    x /= dd, y /= dd;
    bool res = check2(y);
    // if (res == 0)
        // cerr << "?" << a << " " << b << " " << c << " " << d << endl;
    return res;
}

pair<ll, ll> get(int x, int y)
{
    if (x == 0)
        return {0, 1};
    ll d = gcd(x, y);
    x /= d, y /= d;
    return make_pair(x, y);
}

void work() {
    ll a, b;
    cin >> a >> b;
    ll dd = gcd(a, b);
    a /= dd, b /= dd;
    ll u = 1;
    while (b % 2 == 0)
        b /= 2, u *= 2;
    while (b % 5 == 0)
        b /= 5, u *= 5;
    pair<ll, ll> ans;
    ans = {lim + 1, lim + 1};
    pair<ll, ll> ans2;
    ans2 = {lim + 1, lim + 1};
    // cerr << "!!" << inv(u, b) << endl;
    for (int i = 1; i <= tot && all[i] * u * b <= lim; i++)
    {
        ll c = (b - all[i] % b * a % b) % b;
        ans = min(ans, get(c, all[i] * u * b));
        ll c2 = (b - all[i] % b * a % b) % b * inv(u, b) % b;
        ans2 = min(ans2, get(c2, all[i] * b));
    }
    for (int i = 1; i <= tot && all[i] * b <= lim; i++)
    {
        ll c2 = (b - all[i] % b * a % b) % b * inv(u, b) % b;
        ans2 = min(ans2, get(c2, all[i] * b));
    }
    // ll d = gcd(ans.first, ans.second);
    // if (ans.first != 0)
    // {
        // ll d = gcd(ans.first, ans.second);
        // if (d != 1)
            // cerr << a << " " << b << endl;
        // assert(d == 1);
        // ans.first /= d, ans.second /= d;
    // }
    // if (ans.first == 0)
    //     ans.second = 1;
    // if (ans2.first != 0)
    // {
    //     ll d = gcd(ans2.first, ans2.second);
    //     if (d != 1)
    //         cerr << a << " " << b << endl;
    //     assert(d == 1);
    //     ans2.first /= d, ans2.second /= d;
    // }
    // if (ans2.first == 0)
    //     ans2.second = 1;
    // assert(ans2.first >= 0 && ans2.first <= lim);
    // assert(ans2.second >= 1 && ans2.second <= lim);
    // assert(ans.first >= ans2.first);
    // cerr << ans.first << " " << ans.second << endl;
    // assert(check(a, b * u, ans.first, ans.second));
    // assert(check(a, b * u, ans2.first, ans2.second));
    // ans = min(ans, ans2);
    cout << ans.first << " " << ans.second << '\n';
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
    init();
    cin >> T;
    while (T--) work();
}