//
// Created by 16373 on 2024/11/13.
//
#include <bits/stdc++.h>
#define int __int128
using namespace std;
const int mod=998244353,inf=1e24,inf1=1e9;
int gcd(int a,int b)
{
    return b ? gcd(b,a % b) : a;
}
__int128 read(){
    __int128 x=0,f=1;
    char ch=getchar();
    while(!isdigit(ch)&&ch!='-')ch=getchar();
    if(ch=='-')f=-1,ch=getchar();
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return f*x;
}
void print(__int128 x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)print(x/10);
    putchar(x%10+'0');
}
int qpow(int a,int x){
    int res=1;
    while(x){
        if(x&1) res=res*a;
        x>>=1;
        a*=a;
    }
    return res;
}
void solve(){
    int a,b;
    a=read(); b=read();
    int prime=b;
    int cnt2=0,cnt5=0;
    while(prime%2==0){
        cnt2++;
        prime/=2;
    }
    while(prime%5==0){
        cnt5++;
        prime/=5;
    }
    int pw2=qpow(2,cnt2),pw5=qpow(5,cnt5);
    int now2=1;
//    unordered_map<int,pair<int,int>> mp;
    int c=inf,d;
    for(int i=0;prime*now2*pw2*pw5<=inf;i++,now2*=2){
        int now=now2;
        for(int j=0;prime*now*pw2*pw5<=inf;j++,now*=5){
            int md=a*now%prime;
            int ans=(prime-md)%prime;
            int nc=ans,nd=prime*pw2*pw5*qpow(2,i)*qpow(5,j);
            int gc=gcd(nc,nd);
            nc/=gc;  nd/=gc;
            if(nd<=(int)1e9 && nc<c){
                c=nc;
                d=nd;
            }
        }
    }
    print(c); printf(" "); print(d); printf("\n");
}
signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    int t;
    t=read();
    while(t--){
        solve();
    }
    return 0;
}
//2
//630
//3029 2336 377 41 10 61
//3000
//20000 10000 0 0 0 0