#include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
int t,a,b,n,gcdd,minn,minx;
string s,ss;
bool xuan[21];
int stolll(string s)
{
    int res=0;
    for(int i=0;i<s.size();i++)
    {
        res=res*10+s[i]-'0';
    }
    return res;
}
void dfs(int x)
{
    if(x==n)
    {
        string res="";
        for(int i=0;i<n;i++)
        {
            if(xuan[i])
            {
                res+=s[i];
            }
        }
        int num=stolll(res);
        if(num==0)
            return;
        if(a*b%num!=0)
            return;
        num=b*num/a;
        string res2=to_string(num);
        string res3="";
        for(int i=0,j=0;i<res2.size(),j<ss.size();j++)
        {
            if(res2[i]==ss[j])
            {
                res3+=ss[j];
                i++;
            }
        }
        //cout<<res<<' '<<res2<<' '<<res3<<' '<<gcdd<<endl;
        if(res3==res2)
        {
            int ans1=stolll(res);
            int ans2=stolll(res3);
            minn=min(minn,ans1);
            minx=min(minx,ans2);
        }
        return;
    }
    xuan[x]=true;
    dfs(x+1);
    xuan[x]=false;
    dfs(x+1);
}
signed main()
{
    scanf("%lld",&t);
    while(t--)
    {
        scanf("%lld %lld",&a,&b);
        memset(xuan,0,sizeof(xuan));
        bool flag=false;
        if(a>b) 
        {
            flag=true;
            swap(a,b);
        
        }minn=a,minx=b;
        s=to_string(a);
        ss=to_string(b);
        n=s.size();
        dfs(0);
        if(!flag)
            printf("%lld %lld\n",minn,minx);
        else
            printf("%lld %lld\n",minx,minn);
    }
    return 0;
}