#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){

    string K, S="";
    ll N, M, ok=-1, s;
    cin >> N >> K;
    vector<ll> c(10), d;
    for (int i=1; i<=9; i++) cin >> c[i];
    d = c;
    M = K.size();

    if (M < N){
        for (int i=1; i<=9; i++) S += string(c[i], '0'+i);
        cout << S << endl;
        return 0;
    }
    else if (M > N){
        cout << -1 << endl;
        return 0;
    }

    for (int i=0; i<N; i++){
        s = K[i]-'0';
        for (int j=s+1; j<=9; j++) if (c[j]) ok=i;
        if (c[s]) c[s]--;
        else break;
    }

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

    for (int i=0; i<ok; i++){
        S += K[i];
        d[K[i]-'0']--;
    }
    for (int i=K[ok]-'0'+1; i<=9; i++){
        if (d[i]){
            S += i+'0';
            d[i]--;
            break;
        }
    }

    for (int i=1; i<=9; i++) S += string(d[i], i+'0');

    cout << S << endl;

    return 0;
}