/* -*- coding: utf-8 -*-
 *
 * 1630.cc:  No.1630 Sorting Integers (Greater than K) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 500000;

/* typedef */

/* global variables */

char s[MAX_N + 4], t[MAX_N + 4];
int cs[10];

/* subroutines */

int cmpv(int m, char s[], int n, char t[]) {
  if (m != n) return m - n;
  for (int i = 0; i < n; i++)
    if (s[i] != t[i]) return s[i] - t[i];
  return 0;
}

/* main */

int main() {
  int n;
  scanf("%d%s", &n, s);
  for (int i = 1; i <= 9; i++) scanf("%d", cs + i);
  int m = strlen(s);

  int co = 1;
  for (int i = m - 1; i >= 0; i--) {
    int d = (s[i] - '0') + co;
    s[i] = d % 10 + '0';
    co = d / 10;
  }
  if (co) {
    m++;
    for (int i = m; i > 0; i--) s[i] = s[i - 1];
    s[0] = '1';
  }
  //printf("m=%d\n", m);

  for (int i = 9, p = 0; i >= 1; i--)
    for (int j = 0; j < cs[i]; j++) t[p++] = '0' + i;
  if (cmpv(m, s, n, t) > 0) { puts("-1"); return 0; }
  
  int p = 0;
  if (m == n) {
    for (; p < n; p++) {
      int si = s[p] - '0';
      if (cs[si] > 0) t[p] = s[p], cs[si]--;
      else break;
    }
    if (p < n) {
      while (p >= 0) {
	int si = s[p] - '0', d = si + 1;
	for (; d < 10 && cs[d] == 0; d++);
	if (d >= 10)
	  p--, cs[s[p] - '0']++;
	else {
	  t[p++] = d + '0';
	  cs[d]--;
	  break;
	}
      }
    }
  }

  for (int i = 1; i <= 9; i++)
    while (cs[i]) t[p++] = '0' + i, cs[i]--;

  puts(t);
  return 0;
}