#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	string k; cin >> k;
	reverse(all(k));
	rep(i, n - k.size())k += '0';
	reverse(all(k));
	vector<int>c(9);
	rep(i, 9) cin >> c[i];
	{
		vector<int>mxk(n);
		int num = 0;
		rrep(i, 9)rep(j, c[i]) {
			mxk[num] = i + 1;
			num++;
		}
		bool b = false;
		rep(i, n) {
			int n = k[i] - '0';
			if (n == mxk[i]) continue;
			if (n < mxk[i]) {
				b = true;
				break;
			}
			else break;
		}
		if (!b) {
			cout << -1 << endl;
			return 0;
		}
	}
	int memo = -1;
	string ans;
	rep(i, k.size() - 1) {
		int now = k[i] - '1';
		int next = k[i + 1] - '1';
		if (-1 == now) break;
		if (0 == c[now])break;
		bool b = false;
		rep2(j, next + 1, 9) {
			int x = 1;
			if (now == j) x++;
			if (c[j] >= x)b = true;
		}
		if (!b) break;
		c[now]--;
		memo++;
		ans += k[i];
	}
	int x = k[ans.size()] - '1' + 1;
	rep2(i, x, 9) {
		if (c[i] > 0) {
			c[i]--;
			ans += '1' + i;
			break;
		}
	}
	rep(i, 9) rep(j, c[i]) {
		ans += '1' + i;
	}
	cout << ans << endl;
	return 0;
}