#include <bits/stdc++.h>
using namespace std;
using i64 = long long;

i64 exgcd(i64 a, i64 b, i64 &x, i64 &y) {
    if (b == 0) { 
        x = 1; 
        y = 0; 
        return a;
    }
    i64 gcd = exgcd(b, a % b, x, y);
    i64 tmp = x; 
    x = y;
    y = tmp - a / b * y;
    return gcd;
}

i64 cal(i64 a, i64 b, i64 c) {
    i64 x, y;
    i64 gcd = exgcd(a, b, x, y);
    if (c % gcd != 0) return -1;
    x *= c / gcd;
    b /= gcd;
    i64 ansx = x % abs(b);
    if (ansx <= 0) ansx += b;
    return ansx;
}
// c 可以为负值！直接带入 -1 是没问题的！
// 调用cal即为解方程组 ax + by = c 的最小 x, 全部解为 x +- t * b / gcd(a, b); (t为任意整数)

#define int i64

const int inf = 1e12;
void solve() {
    int a, b;
    cin >> a >> b;
    int t = b;
    int k = b;
    while (k % 2 == 0) k /= 2;
    while (k % 5 == 0) k /= 5;
    pair<int, int> ans = {inf, inf};
    for (int i = 1; i * k <= inf; i *= 2) {
        for (int j = 1; j * i * k <= inf; j *= 5) {
            int d = i * j * a % k;
            int x, y;
            int g = exgcd(t / k, k, x, y);
            x = (x % k + k) % k;
            x = x * (k - d) % k;
            ans = min(ans, {x, i * j * k});
        }
    }
    cout << ans.first << ' ' << ans.second << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    cin >> t;
    
    while (t--) {
        solve();
    }

    return 0;
}