#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> int LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> int UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=false){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}
template<class T> T square(T a){return a * a;}



void solve();
// DEAR MYSTERIES / TOMOO
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    // cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    string K;
    cin >> N >> K;
    vector<int> C(10);
    rep(i, 1, 10) cin >> C[i];
    if ((int)K.size() < vec_sum(C)){
        rep(i, 1, 10){
            rep(rp, 0, C[i]) cout << i;
        }
        cout << "\n";
        return;
    }
    if ((int)K.size() > vec_sum(C)){
        cout << "-1\n";
        return;
    }
    // 何文字目まで一致できる？
    int l = -1, r = (int)K.size();
    while (r - l > 1){
        int m = (l + r) / 2;
        string tmp;
        bool ok = true;
        auto B = C;
        rep(i, 0, m){
            int c = K[i] - '0';
            if (B[c] == 0) ok = false;
            B[c]--;
            tmp += K[i];
        }
        if (ok){
            for (int i = 9; i >= 1; i--){
                rep(rp, 0, B[i]) tmp += (char)('0' + i);
            }
            if (tmp <= K) ok = false;
        }
        if (ok) l = m;
        else r = m;
    }
    if (l == -1){
        cout << "-1\n";
        return;
    }
    rep(i, 0, l){
        cout << K[i];
        C[K[i] - '0']--;
    }
    rep(i, K[l] - '0' + 1, 10) if (C[i]){
        C[i]--;
        cout << i;
        break;
    }
    rep(i, 0, 10) while (C[i]--) cout << i;
    cout << "\n";
}