#include"bits/stdc++.h"
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 998244353
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}



signed main(){
    int N;cin>>N;
    string S;cin>>S;
    vector<int> C(10, 0);
    rep(i,9) cin>>C[i+1];

    auto check=[&](int m){
        auto cnt=C;
        rep(i,m) cnt[S[i]-'0']--;

        rep(i,10){
            if(cnt[i]<0) return false;
        }

        string t="";
        for(int i=9;i>=0;i--)rep(j,cnt[i]) t.push_back(i+'0');
        for(int i=m;i<N;i++){
            if(S[i]<t[i-m]) return true;
            if(S[i]>t[i-m]) return false;
        }
        return false;
    };

    int lw=0,hi=N,res=-1;
    while(lw<=hi){
        int mid=(lw+hi)/2;
        if(check(mid)) lw=mid+1,res=mid;
        else           hi=mid-1;
    }

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

    string ans=S.substr(0, res);
    for(auto &c:ans) C[c-'0']--;

    if(res<N){
        for(int i=S[res]-'0'+1;i<10;i++){
            if(C[i]){
                ans.push_back(i+'0');
                C[i]--;
                break;
            }
        }
        rep(i,10)rep(j,C[i]) ans.push_back('0'+i);
    }
    cout<<ans<<endl;
    return 0;
}