#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

int main() {
    int N;
    string K;
    cin >> N >> K;
    vector<int> a(10, 0), b(10, 0), c(10, 0);
    rep(i, 1, 10) cin >> c[i];
    if (N < K.size()) {
        cout << -1 << endl;
        return 0;
    }
    if (N > K.size()) {
        rep(i, 1, 10) {
            rep(j, 0, c[i]) cout << i;
        }
        cout << endl;
        return 0;
    }
    rep(i, 0, K.size()) a[K[i] - '0']++;
    //cout << "a "; rep(i, 0, 10) cout << a[i] << " "; cout << endl;
    for (int i = K.size() - 1; i >= 0; i--) {
        int d = K[i] - '0';
        a[d]--;
        b[d]++;
        //cout << "a "; rep(i, 0, 10) cout << a[i] << " "; cout << endl;
        //cout << "b "; rep(i, 0, 10) cout << b[i] << " "; cout << endl;
        bool f = false;
        rep(j, 0, 10) {
            if (a[j] > c[j]) f = true;
        }
        if (f) continue;
        int x = -1;
        rep(j, d + 1, 10) {
            if (a[j] < c[j]) {
                x = j;
                break;
            }
        }
        if (x == -1) continue;
        rep(j, 0, i) cout << K[j];
        cout << x;
        a[x]++;
        rep(j, 1, 10) {
            rep(k, 0, c[j] - a[j]) cout << j;
        }
        cout << endl;
        return 0;
    }
    cout << -1 << endl;
}