#include <bits/stdc++.h>
#define int long long
#define MOD 1000000007
using namespace std;
int t, a, b, n, gcdd, minn, minx, shu[11], shuu[11], nowshu[11], nowshuu[11];
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 = "";
        memset(nowshu, 0, sizeof(nowshu));
        memset(nowshuu, 0, sizeof(nowshuu));
        for (int i = 0; i < n; i++)
        {
            if (xuan[i])
            {
                res += s[i];
                nowshu[s[i] - '0']++;
            }
            //cout<<"res:"<<res<<endl;
        }
        //cout<<res<<endl;
        int num = stolll(res);
        if (num == 0)
            return;
        if (b * num % a != 0)
            return;
        num = b * num / a;
        string res2 = to_string(num),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 << ' ' << a << '/' << b<<' '<<res3 << endl;
        if(res3!=res2)
            return;
        for (int i = 0; i < res2.size(); i++)
        {
            nowshuu[res2[i] - '0']++;
        }
        for (int i = 0; i < 10; i++)
        {
            //if(res=="670512")
                //cout<<shu[i]<<' '<<nowshu[i]<<' '<<shuu[i]<<' '<<nowshuu[i]<<endl;
            if (shu[i] - nowshu[i] < 0 || shuu[i] < nowshuu[i])
            {
                return;
            }
            if (shu[i] - nowshu[i] != shuu[i] - nowshuu[i])
            {
                return;
            }
        }
        int ans1 = stolll(res);
        int ans2 = stolll(res2);
        //cout<<ans1*b<<' '<<a*ans2<<endl;
        if (ans1 * b == a * ans2)
        {
            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));
        memset(shu, 0, sizeof(shu));
        memset(shuu, 0, sizeof(shuu));
        bool flag = false;
        if (a > b)
        {
            flag = true;
            swap(a, b);
        }
        minn = a, minx = b;
        s = to_string(a);
        ss = to_string(b);
        for (int i = 0; i < s.size(); i++)
        {
            shu[s[i] - '0']++;
        }
        for(int i = 0; i < ss.size(); i++)
        {
            shuu[ss[i] - '0']++;
        }
        n = s.size();
        dfs(0);
        if (!flag)
            printf("%lld %lld\n", minn, minx);
        else
            printf("%lld %lld\n", minx, minn);
    }
    return 0;
}