#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, lim = 1e9;
int pw2[N], pw5[N], a, b, T, w;
long long c, d;
long long gcd(long long a, long long b){
	return b ? gcd(b, a % b) : a;
}
void exgcd(long long a, long long b, long long &x, long long &y){
	if(!b){
		x = 1, y = 0;
		return;
	}
	exgcd(b, a % b, y, x); y -= (a / b) * x;
}
long long solve(long long a, long long b, long long c){
	long long x, y;
	exgcd(a, b, x, y);
	c %= a;
	b = (b * c % a + a) % a;
	if(b > 0) return a - b;
	return b;
}
int main()
{
	scanf("%d", &T);
	while(T--){
		scanf("%d%d", &a, &b);
		int x = 1, y = 1;
		while(b % 2 == 0) y *= 2, b /= 2;
		while(b % 5 == 0) y *= 5, b /= 5;
		c = 1e18, d = 0;
		if(b == 1){
			puts("0 1");
			continue;
		}
		for(long long i = b; i <= lim; i *= 2){
			for(long long j = i; j <= lim; j *= 5){
				x = j / b;
				long long tmp = solve(b, y, x * a);
				if(tmp < c || (tmp == c && d > j)) c = tmp, d = j;
			}
		}
		printf("%lld %lld\n", c, d);
	}
	return 0;
}