#include <bits/stdc++.h>

using namespace std;

void mn (vector < int > a, int k) {

    auto b = a;
    sort(b.begin(), b.end());
    for (int i = 0; i < a.size(); ++i) {
        if (b[i]) {
            swap(b[0], b[i]);
            break;
        }
    }

    set < int > p[10];

    for (int i = 0; i < a.size(); ++i)
        p[a[i]].insert(i);

    for (int i = 0; i < a.size() && k; ++i) {

        if (a[i] != b[i]) {
            int x = *(p[b[i]].begin());
            p[a[i]].erase(i);
            p[b[i]].erase(x);
            p[b[i]].insert(i);
            p[a[i]].insert(x);
            swap(a[i], a[x]);
            k--;
        }

    }

    for (int i : a)
        cout << i;
    cout << " ";
}

void mx (vector < int > a, int k) {
    auto b = a;
    sort(b.begin(), b.end());
    reverse(b.begin(), b.end());

    set < int > p[10];

    for (int i = 0; i < a.size(); ++i)
        p[a[i]].insert(i);

    for (int i = 0; i < a.size() && k; ++i) {

        if (a[i] != b[i]) {
            int x = *(--p[b[i]].end());
            p[a[i]].erase(i);
            p[b[i]].erase(x);
            p[b[i]].insert(i);
            p[a[i]].insert(x);
            swap(a[i], a[x]);
            k--;
        }

    }

    for (int i : a)
        cout << i;
    cout << " ";

}

void slv () {
    int n, k;
    cin >> n >> k;

    vector < int > a;
    while (n) {
        a.push_back(n % 10);
        n /= 10;
    }
    reverse(a.begin(), a.end());

    mn(a, k);
    mx(a, k);
}

int32_t main () {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int test = 1;
    cin >> test;
    while (test--) {
        slv();
        cout << "\n";
    }
}