#include <bits/stdc++.h>

constexpr int D = 9;

void solve() {
    int k;
    std::cin >> k;
    std::array<int, D> ar;
    for (auto& i : ar) {
        std::cin >> i;
    }
    std::vector<int> vec;
    for (int i = 0; i < D; i++) {
        vec.insert(vec.end(), ar[i], i + 1);
    }
    std::pair<std::string, std::string> ans(std::string(1, 10), "");
    do {
        std::string s(vec.begin(), vec.end());
        std::string max;
        for (int i = 0; i < s.size() - k + 1; i++) {
            max = std::max(max, s.substr(i, k));
        }
        ans = std::min(ans, {max, s});

    } while (std::next_permutation(vec.begin(), vec.end()));

    for (auto& ch : ans.second) {
        ch += '0';
    }
    std::cout << ans.second << "\n";
    // std::cout.flush();
}

int32_t main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}