#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

int T;
long long a, b, ansA, ansB;
string A, B;
string tmpA = "";

string turnstring(long long x){
	string res = "";
	while (x){
		res.push_back((x % 10) + '0');
		x /= 10;
	}
	reverse(res.begin(), res.end());
	return res;
}

long long turnint(string s){
	long long res = 0;
	for (auto && i : s){
		res = (res * 10) + (i ^ '0');
	}
	return res;
}

bool check(string tmpA, string tmpB){
	int pos = 0;
	for (int i = 0; i < B.size() && pos < tmpB.size(); i ++){
		if (B[i] == tmpB[pos]) pos ++;
	}
	if (pos != tmpB.size()) return false;
	vector<int> eraA(10, 0), eraB(10, 0);
	for (auto && i : A) eraA[i - '0'] ++;
	for (auto && i : B) eraB[i - '0'] ++;
	for (auto && i : tmpA) eraA[i - '0'] --;
	for (auto && i : tmpB) eraB[i - '0'] --;
	if (eraA != eraB) return false;
	return true;
}

void solve(){
	long long rem = turnint(tmpA); // A
	long long cur = rem;
	if (cur % a) return;
	cur /= a;
	if (cur > 1000000000000000000LL / b) return;
	cur *= b; // B
	if (rem >= ansA) return;
	string tmpB = turnstring(cur);
	int pos = 0;
	for (int i = 0; i < B.size() && pos < tmpB.size(); i ++){
		if (B[i] == tmpB[pos]) pos ++;
	}
	if (pos != tmpB.size()) return;
	int cnt = 0;
	for (int i = 0; i < B.size(); i ++) cnt += (B[i] == '0');
	bool P = 0;
	for (int i = 0; i <= cnt; i ++){
		P |= check(tmpA, tmpB);
		tmpB = "0" + tmpB;
	}
	if (!P) return;
	ansA = rem, ansB = cur;
}

void dfs(int k){
	if (k == A.size()){
		if (turnint(tmpA) == 0) return;
		solve();
		return;
	}
	tmpA.push_back(A[k]);
	dfs(k + 1);
	tmpA.pop_back();
	dfs(k + 1);
}

int main(){
#ifndef ONLINE_JUDGE
	freopen("../data.in", "r", stdin);
	freopen("../data.out", "w", stdout);
#endif

	scanf("%d", &T);
	while (T --){
		tmpA = "";
		scanf("%lld %lld", &a, &b);
		ansA = a, ansB = b;
		A = turnstring(a), B = turnstring(b);
		long long cur = __gcd(a, b);
		a /= cur, b /= cur;
		dfs(0);
		printf("%lld %lld\n", ansA, ansB);
	}

	return 0;
}