#pragma GCC optimize(3)
#include<bits/stdc++.h>
#define int long long
#define rep(i, j, k) for(int i = j; i <= k; ++ i)
using namespace std;
int Mod;
int fpow(int a, int b){
	int x = 1;
	while(b){
		if(b & 1) x = x * a % Mod;
		a = a * a % Mod;
		b >>= 1;
	}
	return x;
}
void solve(){
	int a, b;
	cin >> a >> b;
	int t1 = 0, t2 = 0, t, x = 1, y = 1, z = 1;
	while(b % 2 == 0){
		t1++;
		b /= 2;
		x *= 2;
	}
	while(b % 5 == 0){
		t2++;
		b /= 5;
		x *= 5;
	}
	if(b == 1){
		cout << 0 << " " << 1 << endl;
		return;
	}
	t = max(t1, t2);
	for(int i = 1; i <= t; ++ i) y = y * 10;
	z = y / x;
	Mod = b;
	int tt = b, phi = b;
	rep(i, 2, sqrt(tt)){
		if(tt % i == 0){
			phi /= i;
			phi *= (i - 1);
			while(tt % i == 0) tt /= i;
		}
	}
	if(tt){
		phi /= tt;
		phi *= (tt - 1);
	}
	int tar = a * z % Mod * fpow(y % Mod, phi - 1) % Mod;
	int pow2 = 1, bs2 = b;
	int minn = 1e9, mind = 1;
	while(bs2 <= 1e9){
		int pow5 = pow2, c = bs2;
		while(c <= 1e9){
			int tx = tar * pow5 % Mod; 
			tx = (Mod - tx);
			if(minn > tx){
				minn = tx;
				mind = c;
			}
			pow5 *= 5;
			c *= 5;
		}
		pow2 <<= 1;
		bs2 <<= 1;
	}
	cout << minn << " " << mind << endl;
}
signed main(){
	ios::sync_with_stdio(0);
	int T;
	cin >> T;
	while(T--) solve();
}