#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr int A = 10;

void solve() {
    int k;
    cin >> k;

    int d[A]{}, dd[A]{};
    for (int i = 1; i < A; ++i) {
        cin >> d[i];
        dd[i] = d[i];
    }

    const int n = accumulate(d, d + A, 0);
    if (n == 1) {
        for (int i = A - 1; i >= 0; --i) {
            if (d[i]) {
                cout << i << '\n';
                return;
            }
        }
    }
    vector<int> ans(n);

    if (k == 2) {
        ans[n - 1] = A - 1;
        while (!d[ans.back()]) {
            --ans.back();
        }
        --d[ans.back()];
        int x = ans.back();
        while (!d[x]) {
            --x;
        }

        int p = n - 2;
        for (int i = 1; i < x; ++i) {
            while (d[i]--) {
                ans[p--] = i;
                if (d[x] > 0) {
                    ans[p--] = x;
                    --d[x];
                }
            }
        }
        while (d[x]--) {
            ans[p--] = x;
        }
    } else {
        int x = d[2] ? 2 : 1;

        for (int i = 1; i < k; ++i) {
            ans[n - i] = x;
            if (--d[x] == 0) {
                x -= 1;
            }
        }

        if (d[2] == 0) {
            for (int i = k; i <= n; ++i) {
                ans[n - i] = 1;
            }
        } else {
            int cnt = d[2];
            int f = d[1] / cnt, p = 0;
            for (int i = 0; i < cnt; ++i) {
                ans[p++] = 2;
                int s = i + 1 == cnt ? d[1] - f * (cnt - 1) : f;
                for (int t = 0; t < s; ++t) {
                    ans[p++] = 1;
                }
            }
        }
    }

    for (int i = 0; i < n; ++i) {
        cout << ans[i];
        --dd[ans[i]];
    }
    for (int x : dd) {
        assert(x == 0);
    }
    cout << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int test = 1;
    cin >> test;

    while (test--) {
        solve();
    }

    return 0;
}