//#include <atcoder/all>
#include<bits/stdc++.h>
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<ll>>;
ll MM = 52 * 52 * 52;
Graph G(MM);
Graph invG(MM);

string P(string K) {
    reverse(all(K));
    ll i = 0;
    while (i < K.size()) {
        if (K[i] != '9') {
            K[i]++;
            reverse(all(K));
            return K;
        }
        else {
            K[i] = 0;
            i++;
        }
    }
    K = K + '1';
    reverse(all(K));
    return K;
}

int main() {
    ll N;
    string K;
    cin >> N >> K;
    //K=P(K);
    vll Cj(9);
    rep(i, 9)cin >> Cj[i];
    vll Cb = Cj;
    if (N < K.size()) {
        cout << -1 << endl;
        return 0;
    }
    else {
        ll n = N - K.size();
        rep(i, n) {
            K = '0' + K;
        }
    }

    bool Ch = true;
    string anj = "";
    string an2 = "";
    rep(i, N) {
        Ch = true;

        rep(k, 9) {
            if (K[i] >= (k + '1'))continue;
            if (Cj[k] <= 0)continue;

            if (anj != "NOT") {
                an2 = anj + char(k + '1');

                Cb = Cj;

                Cb[k]--;
                Ch = false;
                break;
            }



        }
        if (Ch) {
            if (anj != "NOT") {
                rep(k, 9) {
                    if (Cb[k] <= 0)continue;

                    if (anj != "NOT") {
                        an2 = an2 + char(k + '1');

                    

                        Cb[k]--;
                        Ch = false;
                        break;
                    }



                }

            }
        }
        Ch = true;
        rep(k, 9) {
            if (K[i] > (k + '1'))continue;
            if (Cj[k] <= 0)continue;

            if (K[i] == (k + '1')) {
                if (anj != "NOT") {
                    anj = anj + K[i];
                    Cj[k]--;
                    Ch = false;
                    break;
                }
            }

        }
        if (Ch) {
            rep(j, 9) {
                rep(k, Cb[j]) {
                    an2 = an2 + char(j + '1');


                }
            }
            if (an2 > K) {
                cout << an2 << endl;
            }
            else {
                cout << -1 << endl;
            }
            return 0;
        }


    }
    cout << an2 << endl;

}