#include<bits/stdc++.h>
#define int long long
const int maxd = 1e9;
using namespace std;
set<int> _ds;
vector<int> ds;
void init(){
    priority_queue<int,vector<int>,greater<int> >pq;
    pq.push(1);
    while(!pq.empty()){
        int _ = pq.top();
        pq.pop();
        if(_<=maxd){
            _ds.insert(_);
            pq.push(_*2);
            pq.push(_*5);
        }
    }
    ds = vector<int>(_ds.begin(),_ds.end());
}
// a/b + c/bk = (ak+c)/bk

void solve(){
    int a,b;
    cin>>a>>b;
    int bb = 1;
    while(b%2 == 0){
        b/=2;
        bb*=2;
    }
    while(b%5 == 0){
        b/=5;
        bb*=5;
    }
    int minc = 0x7f7f7f7f;
    int mind;
    for(auto k:ds){
        int c = (a*k+b-1)/b*b-a*k;
        int d = b*k;
        if(c < minc && bb * d<=maxd){
            minc = c;
            mind = d*bb;
        }
    }
    cout<<minc<<' '<<mind<<endl;
}
signed main(){
    init();
//    cout<<ds.size()<<endl;
    int T;
    cin>>T;
    while(T--)solve();

}