#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 1;

#define int ll
void solve()
{
    int a, b;
    cin >> a >> b;
    while (b % 2 == 0)
        b /= 2;
    while (b % 5 == 0)
        b /= 5;
    if (b == 1)
    {
        cout << "0 1" << endl;
        return;
    }

    pll ans = {INT_MAX, -1};
    for (int t1 = 1; t1 * b <= 1e9; t1 *= 2)
    {
        for (int t2 = 1; t1 * t2 * b <= 1e9; t2 *= 5)
        {

            int q = t1 * t2;
            int c = ((q * a) + b - 1) / b * b - q * a;
            int d = q * b;
            if (c < ans.first)
            {
                ans = {c, d};
            }
        }
    }
    // cout << (1876 % 7 == 0) << endl;
    cout << ans.first << " " << ans.second << endl;
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    while (_--)
        solve();
    return 0;
}