#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

void solve(){
  ll a, b;
  cin >> a >> b;
  vector<__int128_t> mul2(30);
  vector<__int128_t> mul5(30);
  vector<__int128_t> mul10(30);
  mul2[0] = mul5[0] = mul10[0] = 1;
  ll m = max(ceil(log(b) / log(5)), ceil(log2(b)));
  for(int i = 1; i <= m; ++i){
    mul2[i] = mul2[i - 1] * __int128_t(2);
    mul5[i] = mul5[i - 1] * __int128_t(5);
    mul10[i] = mul10[i - 1] * __int128_t(10);
  }
  ll miny = 0x7fffffffff;
  ll totd;
  for(ll i = 0; i <= m; ++i){
    __int128_t r = 1;
    ll curb = b;
    ll num2 = 0;
    ll num5 = 0;
    while(curb % 2 == 0){
      curb /= 2ll;
      num2++;
    }
    while(curb % 5 == 0){
      curb /= 5ll;
      num5++;
    }
    for(ll j = 0; j < min(i, num2); ++j){
      r *= 2ll;
    }
    for(ll j = 0; j < min(i, num5); ++j){
      r *= 5ll;
    }
    for(ll p = 0; p <= i; ++p){
      for(ll q = 0; q <= i; ++q){
        if((mul10[i] / r) % mul2[p] || (mul10[i] / r) % mul5[q]){
          continue;
        }
        __int128_t cur = mul10[i] / r * a / mul2[p] / mul5[q];
        __int128_t now = b / r;
        __int128_t bn = cur / now + 1;
        __int128_t c = (bn * now - cur) % now;
        __int128_t t = mul10[i] / mul2[p] / mul5[q];
        __int128_t curd = t * b / r;
        if(c < miny){
          miny = c;
          totd = curd;
        }
      }
    }
  }
  cout << miny << ' ' << totd << '\n';
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int t;
  cin >> t;
  while(t--){
    solve();
  }
}