#include<bits/stdc++.h>
//#include<atcoder/all>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
//using namespace atcoder;
//using namespace boost::multiprecision;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(),A.end()
#define RALL(A) A.rbegin(),A.rend()
typedef long long ll;
typedef pair<int,int> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
const ll mod=1e9 + 7;
const ll LINF=1ll<<60;
const int INF=1<<30;
int dx[]={0,1,0,-1,0,1,-1,1,-1};
int dy[]={0,0,1,0,-1,1,-1,-1,1};



int main(){
    int n;
    string s;cin >> n >> s;
    vector<int> c(10, 0);
    for (int i = 0; i < 9; i++) {
        cin >> c[i + 1];
    }
    string ans = "";
    while(s.length() < n) s += '0';
    auto b = c;
    string p = "";
    for (int i = 0; i <= n; i++) {
        bool f = true;
        if(i < n){
            if(b[s[i] - '0'] > 0){
                ans += s[i];
                b[s[i]-'0']--;
                f = false;
            }
            else{
                bool ff = true;
                for (int j = s[i]-'0'+1; j < 10; j++) {
                    if(b[j] > 0){
                        b[j]--;
                        p = '0' + j;
                        ans += p;
                        ff = false;
                        break;
                    }
                }
                if(not ff){
                    for (int k = i + 1; k < n; k++) {
                        for (int l = 0; l < 10; l++) {
                            if(b[l] > 0){
                                p = '0' + l;
                                ans += p;
                                b[l]--;
                                break;
                            }
                        }
                    }
                    cout << ans << endl;
                    return 0;
                }
            }
        }
        if(f){
            for (int j = i - 1; j >= 0; j--) {
                bool ff = true;
                ans.pop_back();
                b[s[j] - '0']++;
                for (int k = s[j] - '0' + 1; k < 10; k++) {
                    if(b[k] > 0){
                        p = '0' + k;
                        ans += p;
                        ff = false;
                        b[k]--;
                        break;
                    }
                }
                if(not ff){
                    for (int k = j + 1; k < n; k++) {
                        for (int l = 0; l < 10; l++) {
                            if(b[l] > 0){
                                p = '0' + l;
                                ans += p;
                                b[l]--;
                                break;
                            }
                        }
                    }
                    cout << ans << endl;
                    return 0;
                }
            }
            puts("-1");
            return 0;
        }
    }
    return 0;
}