#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>

#define mkp make_pair
#define mkt make_tuple
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
template <class T>
void chmin(T &a, const T &b) {
    if (a > b) a = b;
}
template <class T>
void chmax(T &a, const T &b) {
    if (a < b) a = b;
}

const int L = 10;

void solve() {
    int N;
    cin >> N;
    string K;
    cin >> K;
    vector<int> C(L, 0);
    for (int i = 1; i < L; i++) cin >> C[i];

    if (K.size() > N) {
        cout << -1 << endl;
        return;
    }
    string zero(N - K.size(), '0');
    K = zero + K;

    vector<vector<int>> cnt(N + 1, vector<int>(L, 0));
    for (int i = N - 1; i >= 0; i--) {
        for (int j = 1; j < L; j++) {
            if (K[i] - '0' == j)
                cnt[i][j] = cnt[i + 1][j] + 1;
            else
                cnt[i][j] = 0;
        }
    }

    vector<int> rest = C;
    string ans = "";
    bool is_greater = false;
    for (int k = 0; k < N; k++) {
        int digit = -1;
        if (is_greater) {
            for (int i = 1; i < L; i++) {
                if (rest[i] > 0) {
                    digit = i;
                    break;
                }
            }
        } else {
            for (int i = 1; i < L; i++) {
                if (i < K[k] - '0') continue;
                if (rest[i] == 0) continue;
                if (i > K[k] - '0') {
                    digit = i;
                    break;
                }

                int now = k + 1;
                bool will_be_greater = false;
                for (int d = L - 1; d >= 1; d--) {
                    int r = rest[d];
                    if (i == d) r--;
                    if (r == cnt[now][d]) {
                        now += cnt[now][d];
                        continue;
                    } else if (r < cnt[now][d]) {
                        break;
                    } else {
                        will_be_greater = true;
                        break;
                    }
                }
                if (will_be_greater) {
                    digit = i;
                    break;
                }
            }
        }

        if (digit == -1) {
            cout << -1 << endl;
            return;
        }

        ans += char('0' + digit);
        rest[digit]--;
        if (digit > K[k] - '0') is_greater = true;
    }

    cout << ans << endl;
}

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

    solve();

    return 0;
}