#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000005

string get(vector<int> c){
	string ret = "";
	for(int i=9;i>=0;i--){
		rep(j,c[i])ret += '0' + i;
	}
	return ret;
}

int main(){
	
	int n;
	cin>>n;
	string K;
	cin>>K;
	
	vector<int> c(10,0);
	rep(i,9)cin>>c[i+1];
	
	if(n<K.size()){
		cout<<-1<<endl;
		return 0;
	}
	
	{
		string t(n-K.size(),'0');
		K = t+K;
	}
	
	if(get(c)<=K){
		cout<<-1<<endl;
		return 0;
	}
	
	int ok = 0,ng = n+1;
	while(ng-ok>1){
		int mid = (ok+ng)/2;
		vector<int> cc = c;
		string temp = "";
		bool f = true;
		rep(i,mid){
			if(cc[K[i]-'0']<=0){
				f=false;
				break;
			}
			temp += K[i];
			cc[K[i]-'0']--;
		}
		if(f){
			string t2 = get(cc);
			temp += t2;
			if(temp <= K)f=false;			
		}
		if(f)ok = mid;
		else ng=  mid;
		
	}
//cout<<ok<<endl;
	string ans = "";
	rep(i,ok){
		ans += K[i];
		c[K[i]-'0']--;
	}
	if(ok!=n){
		rep(i,10){
			if(c[i]==0)continue;
			if(i<=K[ok]-'0')continue;
			ans += '0'+i;
			c[i]--;
			break;
		}
		rep(i,10){
			rep(j,c[i])ans += '0'+i;
		}
	}
	
	cout<<ans<<endl;
	
	return 0;
}