#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
//using mint = modint998244353;
//using mint = modint1000000007;
typedef long long ll;
typedef unsigned long long ull;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int MAX = 1e9;
const int MIN = -1*1e9;
const ll MAXLL = 1e18;
const ll MINLL = -1*1e18;
//const ll MOD = 998244353;
//const ll MOD = 1000000007;

int main()
{
    int T; cin >> T;
    for(int t = 0; t < T; t++)
    {
        ll N; cin >> N;
        string S;
        vector<int> V(10),W(10);
        for(int i = 1; i <= 9; i++)
        {
            int A; cin >> A;
            V[i] = A;
            for(int j = 0; j < V[i]; j++)
            {
                S += to_string(i);
            }
        }
        S = S+S;
        ll P = stoll(S);
        P = P-(P%N);
        string Ans = to_string(P);
        for(auto x : Ans)
        {
            W[x-'0']++;
        }
        bool f = true;
        for(int i = 1; i <= 9; i++)
        {
            if(W[i] < V[i]) f = false;
        }
        if(f)
        {
            cout << P << endl;
            continue;
        }
        P = stoll(S);
        P = P+(N-(P%N));
        Ans = to_string(P);
        W.clear();
        for(auto x : Ans)
        {
            W[x-'0']++;
        }
        f = true;
        for(int i = 1; i <= 9; i++)
        {
            if(W[i] < V[i]) f = false;
        }
        if(f)
        {
            cout << P << endl;
            continue;
        }
    }
    return 0;
}