#include <iostream>
#include <cstring>
#include <algorithm>
#define int long long
using namespace std;
int gcd(int a,int b){
    if(a<b)swap(a,b);
    return (a==b)?a:((a%2==0)?((b%2==0)?2*gcd(a/2,b/2):gcd(a/2,b)):(b%2==0)?gcd(a,b/2):gcd(b,a-b));
}
bool check(short a[],short na,short b[],short nb,int ax,int bx){
    short aax[20]={0},bbx[20]={0};
    short nax=0,nbx=0;
    short numa[10]={0},numb[10]={0};
    while(ax){
        aax[++nax]=ax%10;
        ax/=10;
    }
    while(bx){
        bbx[++nbx]=bx%10;
        bx/=10;
    }
    while(nax>nbx){
        bbx[++nbx]=0;
    }
    while(nbx>nax){
        aax[++nax]=0;
    }
    int i, j;
    for (i = 1, j = 1; i <= na && j <= nax; i ++ ){
        if(a[i]==aax[j])j++;
        else numa[a[i]]++;
    }
    if(j<=nax)return 0;
    while(i<=na)numa[a[i++]]++;
    for (i = 1, j = 1; i <= nb && j <= nbx; i ++ ){
        if(b[i]==bbx[j])j++;
        else numb[b[i]]++;
    }
    if(j<=nbx)return 0;
    while(i<=nb)numb[b[i++]]++;
    for (int i = 0; i < 10; i ++ ){
        if(numb[i]!=numa[i])return 0;
    }
    return 1;
}
void solve(){
    int a,b,ax,bx;
    cin>>a>>b;
    int g=gcd(a,b);
    ax=a,bx=b;
    short aa[20],bb[20],na=0,nb=0;
    while(ax){
        aa[++na]=ax%10;
        ax/=10;
    }
    while(bx){
        bb[++nb]=bx%10;
        bx/=10;
    }
    a/=g,b/=g;
    //cout<<na<<nb;
    for(int i=1;i<=g;i++){
        if(check(aa,na,bb,nb,a*i,b*i)){
            cout<<a*i<<" "<<b*i<<'\n';
            return;
        }
    }
}
signed main()
{
    int T;
    cin>>T;
    while(T--){
        solve();
    }
    // short a[10],b[10];
    // check(a,0,b,0,12323234,222888);
}