#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcount(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

bool f(vector<int> c,string &k,int mid){
    string s;
    rep(i,mid){
        if(k[i]=='0')return false;
        if(c[k[i]-'1']==0)return false;
        c[k[i]-'1']--;
        s+=k[i];
    }
    int pre=s.size();
    for(int j=k[mid]-'0';j<9;j++){
        if(c[j]>=1){
            c[j]--;
            s+=j+'1';
            break;
        }
    }
    if(s.size()==pre)return false;
    rep(i,9){
        while(c[i]--){
            s+=i+'1';
        }
    }
    if(s>k)return true;
    return false;
}

string g(vector<int> c,string &k,int mid){
    string s;
    rep(i,mid){
        c[k[i]-'1']--;
        s+=k[i];
    }
    if(mid<k.size()){
    for(int j=k[mid]-'0';j<9;j++){
        if(c[j]>=1){
            c[j]--;
            s+=j+'1';
            break;
        }
    }
    }
    rep(i,9){
        while(c[i]--){
            s+=i+'1';
        }
    }
    return s;
}

bool check(vector<int> c,string k){
    string s;
    for(int i=8;i>=0;i--){
        while(c[i]--){
            s+=i+'1';
        }
    }
    return (s>k);
}

int main(){
    INT(n);
    string k,ans;
    cin>>k;
    vector<int> c(9),d(10,0);
    int sumv=0;
    in(c);
    if(k.size()<n){
        rep(i,9){
            while(c[i]--)ans+=i+'1';
        }
    }else if(n==k.size()){
        if(!check(c,k)){
            out(-1);
            return 0;
        }
        int l=0,r=n+1,mid;
        while(l<r){
            mid=(l+r)/2;
            if(f(c,k,mid))l=mid+1;
            else r=mid;
        }
        ans=g(c,k,l-1);
    }
    //debug(ans.size(),k.size());
    //return 0;
    if(ans.size()<n)out(-1);
    else out(ans);
}