#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define endl '\n'
#define all(a) a.begin(), a.end()
#define pb push_back
#define x first
#define y second
#define debug(_x) cout << #_x << '=' << _x << endl
typedef pair<int, int> PII;
using i64 = long long;
const int mod = 1e9 + 7;
const int N = 4e5 + 10;

int qsm(int a, int k)
{
    int res = 1;
    while (k)
    {
        if (k & 1)
            res = res * a;
        k >>= 1;
        a = (ll)a * a;
    }
    return res;
}

void solve()
{
    ll a, b;
    cin >> a >> b;
    int now = b / a;
    int mx = 0;
    for (int i = 0; i <= 25; i++)
    {
        for (int j = 0; j <= 25; j++)
        {
            if (1ll * qsm(2, i) * qsm(5, j) <= now)
                mx = max(mx, 1ll * qsm(2, i) * qsm(5, j));
        }
    }
    ll d = mx * b;
    ll c = b - a * mx;
    cout << c << " " << d << endl;
}

signed main()
{
    /*ios::sync_with_stdio(false);
    cin.tie(nullptr);*/
    int _ = 1;
    cin >> _;

    while (_--)
        solve();

    return 0;
}