#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) 的解
void exgcd(int a,int b,int &x,int &y){
	if(!b){
		x = 1;
		y = 0;
		return;
	}

	exgcd(b, a % b, y, x);
	y -= (a / b) * x;
}

vector <int> p;

void init(){
    int i, j;

    rep(i,0,32){
        rep(j,0,40){
            double 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();
    }

}