#include <bits/stdc++.h>
using namespace std;

int Decompose(vector<int>& G, string& T) {
	int ret = G.size(), V = 0;
	for (int i = 0; i < G.size(); ++i) {
		if (V & (1 << i)) continue;
		ret--;
		int cur = i;
		while (!(V & (1 << cur))) {
			if (G[cur] != i) swap(T[cur], T[G[cur]]);
			V |= 1 << cur;
			cur = G[cur];
		}
	}
	return ret;
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int _T;
	cin >> _T;
	while (_T--) {
		string S;
		int K;
		cin >> S >> K;

		vector<int> P(S.size());
		iota(P.begin(), P.end(), 0);
		string ansMin = "999999999999", ansMax = "000000000000";

		sort(P.begin(), P.end());
		do {
			string T = S;
			int k = Decompose(P, T);
			if (k <= K) {
				if (T[0] != '0') {
					ansMin = min(ansMin, T);
					ansMax = max(ansMax, T);
				}
			}
		} while (next_permutation(P.begin(), P.end()));

		cout << ansMin << ' ' << ansMax << '\n';
	}
	return 0;
}