#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
using namespace std;
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a; i > -1; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a; i > b; --i)
#define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define fi first
#define se second
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll mod_998244353 = 998244353;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

// using lll=boost::multiprecision::cpp_int;
// using
// Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<128>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}

ll mypow(ll x, ll n, const ll &p = -1)
{ // x^nをmodで割った余り

  if (p != -1)
  {
    x = (x % p + p) % p;
  }
  ll ret = 1;
  while (n > 0)
  {
    if (n & 1)
    {
      if (p != -1)
        ret = (ret * x) % p;
      else
        ret *= x;
    }
    if (p != -1)
      x = (x * x) % p;
    else
      x *= x;
    n >>= 1;
  }
  return ret;
}

struct myrand{
  random_device seed;
  mt19937 mt;
  myrand():mt(seed()){}
  int operator()(int a,int b){//[a,b)
    uniform_int_distribution<int>dist(a,b-1);
    return dist(mt);
  }
};

//using namespace atcoder;

//------------------------
//------------------------
//------------------------
//------------------------
//------------------------

void ng(){
  cout<<-1<<"\n";
  exit(0);
}
void solve()
{
  int n;
  string k;
  cin>>n>>k;
  vector<int>c(9);
  rep(i,9)cin>>c[i];
  auto cc=c;
  int m=k.size();
  string ans;
  if(n<m)ng();
  else if(n>m){
    rep(i,9){
      while(c[i]>0){
        ans+=char('1'+i);
        c[i]--;
      }
    }
    cout<<ans<<"\n";
  }else{
    rep(i,n)ans+="9";
    auto func=[&](int id)->bool{
      c=cc;
      string ret;
      rep(i,id){
        if(k[i]=='0')return false;
        else if(c[k[i]-'1']==0)return false;
        else {
          ret+=k[i];
          c[k[i]-'1']--;
        }
      }
      bool check=false;
      REP(i,k[id]-'0',9){
        if(c[i]>0){
          c[i]--;
          ret+=char('1'+i);
          check=true;
          break;
        }
      }
      if(!check)return false;
      REP(i,id+1,n){
        rep(j,9){
          if(c[j]>0){
            c[j]--;
            ret+=char('1'+j);
            break;
          }
        }
      }
      chmin(ans,ret);
      return true;
    };
    for(int i=m-1;i>=0;--i){
      if(func(i)){
        cout<<ans<<"\n";
        return;
      }
    }
    ng();
  }
}

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