#include <bits/stdc++.h>
#define min(a,b) (a > b ? b : a)
#define max(a,b) (a < b ? b : a)

#define YES (cout << "YES" << endl)
#define NO (cout << "NO" << endl)
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define mem(a,b) memset(a,b,sizeof(a))
#define rrep(a, b, c) for (a = b; a >= c; a--)
#define rep(a, b, c) for (a = b; a <= c; a++)
#define int long long
#define IOS ios::sync_with_stdio(0); cout.tie(0);

using namespace std;

typedef double db;
typedef pair<int,int> pii;
typedef array <int,3> a3;

const db eps = 1e-7;
const int inf = 2e10;
const int N = 200010;

// ax + by = gcd(a, b) 的解
int exgcd(int a,int b,int &x,int &y){
    if (b==0){
        x = 1;
        y = 0;
        return a;
    }

    int x1, y1, res;
    res = exgcd(b, a % b, x1, y1);
    x = y1 , y = x1 - a/b *y1;
    return res;
}

// 解 ax + by = c 的解 其中 x 是负数 
pii solve(int a, int b, int c) { 
    // cout << "SOLVE : " << a << ' ' << b << " " << c << endl;  
    int gcd = __gcd(a, b); 
    
    if (c % gcd != 0){
        return {-inf, -inf}; 
    }
    
    int x = 0, y = 0; 
    int cnt = c / gcd; 
    
    exgcd(a, b, x, y); 
    
    x *= cnt; y *= cnt; 

    int l = -inf, r = inf;
    while (l + 1 != r){
        int mid = l + r >> 1;
        int nowx = x + (b / gcd) * mid;

        if (nowx <= 0){
            l = mid;
        }else{
            r = mid;
        }
    }

    x = x + (b / gcd) * l;
    y = y - (a / gcd) * l;

    return {x, y}; 
}

vector <int> p;

void init(){
    int i, j;

    rep(i,0,32){
        rep(j,0,32){
            int val = pow(2, i) * pow(5, j);
            if (val > 1e9) break;
            p.push_back(val);
        }
    }
}

void solve(){
    int a, b;
    cin >> a >> b;

    int ansc = inf;
    int ansd = inf;

    int b2 = b;
    while (b2 % 2 == 0) b2 /= 2;
    while (b2 % 5 == 0) b2 /= 5;

    int b3 = b / b2;

    for (int x : p){
        int val = a * x % b2;
        val = (b2 - val) % b2;

        int d = x * b2;
        int X,Y;

        exgcd(b3, b2, X, Y); 
        X = (X % b2 + b2) % b2;

        int c = X * val % b2;
        if (c < ansc){
            ansc = c;
            ansd = d;
        }
    }

    cout << ansc << ' ' << ansd << endl;
}

/*

 4
 1 2
 2 3
 3 7
 19 79

*/

signed main(){
    cin.tie(0);
    init();

    int T = 1;
    cin >> T;

    while (T --){
        solve();
    }

}