//  ↘ ⬇ ⬇ ⬇ ⬇ ⬇ ↙
//  ➡ @roadfromroi ⬅
//  ↗ ⬆ ⬆ ⬆ ⬆ ⬆ ↖
#include <iostream>
#include "vector"
#include "algorithm"
#include "numeric"
#include "climits"
#include "iomanip"
#include "bitset"
#include "cmath"
#include "map"
#include "deque"
#include "array"
#include "set"
#define all(x) x.begin(), x.end()
using namespace std;
struct dsu{
    vector<int> nxt;
    void init(int n) {
        nxt.assign(n, {});
        for (int i = 0; i < nxt.size(); ++i) {
            nxt[i] = i;
        }
    }
    void plsone() {
        nxt.push_back(0);
        nxt.back() = nxt.size() - 1;
    }
    int getv(int v) {
        if (nxt[v] == v)
            return v;
        return nxt[v] = getv(nxt[v]);
    }
    void pop(int v) {
        nxt[v] = v + 1;
    }
};
void recstr(int v, vector<pair<pair<int, int>, int>> &a, string &s) {
    if (v < 9) {
        s.push_back('1' + v);
        return;
    }
    recstr(a[v].first.first, a, s);
    recstr(a[v].first.second, a, s);
}
void solve() {
    int k;
    cin >> k;
    int sm = 0;
    vector<pair<pair<int, int>, int>> a(9);
    string s1, s2;
    for (auto &i : a) {
        cin >> i.second;
    }
    string sbk;
    int peppa = k - 1;
    for (int i = 8; i >= 0; --i) {
        while (a[i].second and peppa) {
            peppa--;
            a[i].second--;
            sbk.push_back(i + '1');
        }
    }
    reverse(all(sbk));
    int mx = -1;
    int nmx = 0;
    int nmxhelp = 0;
    for (int i = 0; i < 9; ++i) {
        if (a[i].second)
            mx = i;
    }
    for (int i = 0; i < 9; ++i) {
        //if (a[i].second and i != mx)
        nmxhelp += a[i].second;
    }
    dsu nxt;
    nxt.init(9);
    while (nmxhelp != a[mx].second) {
        nmx = nmxhelp - a[mx].second;
        int c = a[mx].second;
        int kt = (c + nmx - 1) / nmx;
        int mx2cnt = mx % kt, mx2 = -1;
        if (kt > 1) {
            int rmx = mx;
            for (int i = 0; i < kt - 1; ++i) {
                if (i + 1 == kt - 1)
                    mx2 = rmx;
                a.push_back({{rmx, mx}, 0});
                nxt.plsone();
                rmx = a.size() - 1;
            }
            a[rmx].second = (a[mx].second + kt - 1) / kt - mx2cnt;
            nmxhelp += a[rmx].second;
            nmxhelp -= a[mx].second;
            a[mx].second = 0;
            mx = rmx;
        }
        int v = nxt.getv(0);
        vector<pair<pair<int, int>, int>> p1, p2;
        while (a[mx].second) {
            while (a[v].second == 0) {
                nxt.pop(v);
                v = nxt.getv(v);
            }
            int stepa = min(a[mx].second, a[v].second);
            a[mx].second -= stepa;
            a[v].second -= stepa;
            p1.push_back({{mx, v}, stepa});
            nmxhelp -= stepa;
        }
        if (mx2cnt) {
            a[mx2].second = mx2cnt;
            nmxhelp += mx2cnt;
            while (a[mx2].second) {
                while (a[v].second == 0) {
                    nxt.pop(v);
                    v = nxt.getv(v);
                }
                int stepa = min(a[mx2].second, a[v].second);
                a[mx2].second -= stepa;
                a[v].second -= stepa;
                p2.push_back({{mx2, v}, stepa});
                nmxhelp -= stepa;
            }
        }
        for (auto i : p2) {
            a.push_back(i);
            nxt.plsone();
        }
        for (auto i : p1) {
            a.push_back(i);
            mx = a.size() - 1;
            nxt.plsone();
        }
    }
    string sres;
    recstr(mx, a, sres);
    string sres2;
    for (int i = 0; i < a[mx].second; ++i) {
        sres2 += sres;
    }
    sres2 += sbk;
    cout << sres2 << '\n';
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}
/*
1
7
2 4 2 0 0 6 2 2 2
 */