#include<bits/stdc++.h>
#define ll __int128
using namespace std;
const int maxn = 1e6 + 5;
const int B = 1000000000;
const ll INF = 1e18;
ll extend_gcd(ll a, ll b, ll &x, ll &y) {
    if(!b) {
        x = 1; y = 0;
        return a;
    }
    ll xt = 0, yt = 0;
    ll d = extend_gcd(b, a % b, xt, yt);
    x = yt;
    y = xt - yt * (a / b);
    return d;
}
void solve() {
    int aa, bb; cin >> aa >> bb;
    ll a = aa, b = bb;
    ll e = b;
    while(e % 2 == 0) { e /= 2; }
    while(e % 5 == 0) { e /= 5; }
    if(e == 1) {
        cout << 0 << " " << 1 << '\n';
        return;
    }
    vector< int > vec;
    for(int i = 1; i * i <= e; i++) {
        if(e % i == 0) {
            int c = i; vec.push_back(c);
            if(c * c == e) continue;
            c = e / i; vec.push_back(c);
        }
    }
    int ansc = b - a, ansd = b;
    // 枚举 d 的可能性
    for(auto item : vec) {
        for(ll i = 0, cur2 = 1; 1LL * cur2 * item <= B; i++, cur2 *= 2) {
            for(ll j = 0, cur5 = 1; 1LL * cur2 * item * cur5 <= B; j++, cur5 *= 5) {
                ll d = item * cur2 * cur5;
                ll down = b * d / __gcd(b, d);
                ll upa = a * down / b;
                ll upcbei = down / d;
                // c 最少是 upcbei 的倍数
                ll ext = e - upa % e;
                // upcbei * x % e == ext
                // 找个 x
                ll x, y;
                ll g = extend_gcd(upcbei, e, x, y);
                if(ext % g == 0) {
                    x *= ext / g;
                    int dx = e / g;
                    x = (x % dx + dx) % dx;
                    if(x == 0) x += dx;
                    ll c = x * upcbei;
                    if(c < ansc) {
                        ansc = c;
                        ansd = d;
                    }
                }
            }
        }
    }

    cout << ansc << " " << ansd << '\n';
}
int main() {
    ios::sync_with_stdio(0), cin.tie(0) ;
    int t = 1;
    cin >> t;
    while(t--) {
        solve();
    }
}