#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}

int n,m,c[10];
int cnt[10][200010];
string S;

void solve(){
  cin >> n >> S;
  int m=S.length();
  Rep(i,1,10) cin >> c[i];
  if(m<n){
    Rep(i,1,10) rep(j,c[i]) cout << i;
    cout << "" << endl;
    return;
  }
  if(m>n){
    cout << -1 << endl;
    return;
  }
  rep(j,m){
    rep(i,10){
      cnt[i][j+1]+=cnt[i][j]+(S[j]-'0'==i);
    }
  }
  per(j,m){
    bool fg=true;
    rep(i,10){
      if(cnt[i][j]>c[i]) {
        fg=false;
        break;
      }
    }
    if(!fg) continue;
    //cout << j << endl;
    Rep(i,S[j]-'0'+1,10){
      if(c[i]-cnt[i][j]>=1){
        rep(k,j) cout << S[k];
        cout << i;
        Rep(l,1,10){
          rep(k,c[l]-cnt[l][j]-(l==i)) cout << l;
        }
        cout << "" << endl;
        return;
      }
    }
  }
  cout << -1 << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}