#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int arr[5];string s;
string maa;string w;int k,x;
string lol[4*4*4*4][13];
void rec(){
    bool ss = 0;
    for(int i = 1;i<=4;i++){
        if(arr[i]){
            ss = 1;
            arr[i]--;s+=char(i+'0');
            rec();
            arr[i]++;
            s.pop_back();
        }
    }
    if(ss==0){
        string ma;
        for(int j = 0;j<s.size()-k+1;j++){
            string se;
            for(int e = j;e<j+k;e++)se+=s[e];
            if(ma.empty())ma = se;
            ma = max(ma,se);
        }
        if(maa.empty()||ma<maa){
            maa = ma;
            w = s;
        }
    }
}
signed main(){
    ios_base::sync_with_stdio(false);cin.tie(0);
    for(int t = 1;t<4*4*4*4;t++){
        int de = 0;
        int e = t;
        int sum = 0;
        for(int i = 1;i<=4;i++){
            arr[i] = e%4;
            e/=4;
            sum+=arr[i];
        }for(int K = 1;K<=sum;K++){
        k = K;
        maa = "";
        rec();
        lol[t][k] = w;
        }
    }
    int t;cin>>t;
    while(t--){
        int k;cin>>k;
        int de = 0;
        for(int i = 1;i<=4;i++){
            cin>>arr[i];
        }
        for(int i = 5;i<10;i++)cin>>x;
        for(int i = 4;i>=1;i--){de*=4;de+=arr[i];}
        cout<<lol[de][k]<<endl;
    }
}