#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef __int128 i128;
const int N=22;
int n,m,cnt[N];
LL x,y,ans=2e18,ans2=2e18;
int a[N],b[N];
void work(int u,LL sum){
	if(u>n){
		if(!sum) return;
		i128 A=x,B=y,C=sum;
		i128 D=B*C/A;
		if(D*A!=B*C) return; 
		LL id=D,cp=id;
		bool flag=0;
		while(cp){
	     	if(!cnt[cp%10]) flag=1;
	     	cnt[cp%10]--,cp/=10;
	    }
	    cp=id;
	    for(int i=1;i<=9;i++) if(cnt[i]) flag=1;
	    while(cp)
	     	cnt[cp%10]++,cp/=10;
	    if(flag) return;
	    int tag=0;
		cp=id;
	    while(cp){
	    	if(cp%10==0) tag++;
	    	cp/=10;
		}
        cp=id;
		for(int i=m;i>=1;i--){
	    	if(b[i]==cp%10) cp/=10;
	    	if(!cp&&!b[i]) tag++;
	    }
	    if(tag<cnt[0]) return;
	    if(!cp) ans=min(ans,sum),ans2=min(ans2,id);
	    return;
	} 
	work(u+1,sum*10+a[u]);
	if(cnt[a[u]]){
		cnt[a[u]]--;
    	work(u+1,sum);
    	cnt[a[u]]++;
    }
}
int Main()
{
	ans=1e18,ans2=1e18;n=m=0;
	memset(cnt,0,sizeof cnt);
    scanf("%lld%lld",&x,&y);
	LL tx=x,ty=y;
    while(x) a[++n]=x%10,x/=10;
    for(int i=1;i<=n/2;i++) swap(a[i],a[n-i+1]);
    while(y) b[++m]=y%10,cnt[y%10]++,y/=10;
    x=tx,y=ty;
    for(int i=1;i<=m/2;i++) swap(b[i],b[m-i+1]);
	work(1,0);
	printf("%lld %lld\n",ans,ans2);
	return 0;
}
int main()
{
    int Case=1;
    scanf("%d",&Case); 
    while(Case--) Main();
	return 0;
}