#include<bits/stdc++.h>
#define fo(i,a,b) for (ll (i)=(a);(i)<=(b);(i)++)
#define pi pair<ll,ll>
#define ll long long 
#define db long double 
using namespace std;
const int N = 1e6 + 5;
const int mo = 998244353;
const ll inf = 1e18;
ll a, b, bb, cc, dd;
void work(ll x) {
    while (x % 2 == 0) x /= 2;
    while (x % 5 == 0) x /= 5;
    bb = x;
}
void exgcd(ll a, ll b, ll& d, ll& x, ll& y) {
    if (!b) {
        x = 1; y = 0; d = a; return;
    }
    exgcd(b, a % b, d, y, x);
    y -= (a / b) * x;
}
void check(ll d) {
    ll k0, c0, gcd, A, B, Y, u;
    A = bb * bb; B = b;  Y = a * d;

    exgcd(A, -B, gcd, k0, c0);

    // cout << k0 << " " << c0 << "\n";

    if (Y % gcd) return;

    c0 = -c0;
    gcd = abs(gcd);
    u = A / gcd;
    // k0 = k0 * (Y / gcd);
    c0 = c0 % u * (Y / gcd) % u;

    


    c0 = (c0 % u + u) % u;

    if (cc > c0) {
        cc = c0;
        dd = d;
    }

}
void solve() {
    cc = inf;
    cin >> a >> b;

    // a = 3; b = 7;
    work(b);

    ll p2 = 1, p5;
    fo(i, 0, 30) {
        p5 = 1;
        fo(j, 0, 15) {
            if (p2 * p5 > 1e9) break;
            if (p2 * p5 * bb > 1e9) break;

            check(bb * p2 * p5);
            p5 = p5 * 5;
            if (p5 > 1e9) break;
        }
        p2 = p2 * 2;
    }

    cout << cc << " " << dd << "\n";

}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);


    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}