import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum B = 10;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const K = readToken();
      auto C = new int[B];
      foreach (x; 1 .. B) {
        C[x] = readInt();
      }
      
      bool check(int l) {
        auto cs = C.dup;
        foreach (i; 0 .. l) {
          const k = K[i] - '0';
          if (cs[k] == 0) {
            return false;
          }
          --cs[k];
        }
        int x = B - 1;
        foreach (i; l .. N) {
          const k = K[i] - '0';
          for (; cs[x] == 0; --x) {}
          if (x > k) {
            return true;
          } else if (x < k) {
            return false;
          }
          --cs[x];
        }
        return false;
      }
      
      if (K.length < N) {
        foreach (x; 1 .. B) {
          foreach (_; 0 .. C[x]) {
            write(x);
          }
        }
        writeln;
      } else if (K.length > N) {
        writeln(-1);
      } else {
        if (check(0)) {
          int lo = 0, hi = N;
          for (; lo + 1 < hi; ) {
            const mid = (lo + hi) / 2;
            (check(mid) ? lo : hi) = mid;
          }
          debug {
            writeln("lo = ", lo);
          }
          
          auto ans = new int[N];
          auto cs = C.dup;
          foreach (i; 0 .. lo) {
            const k = K[i] - '0';
            --cs[k];
            ans[i] = k;
          }
          foreach (x; (K[lo] - '0') + 1 .. B) {
            if (cs[x] > 0) {
              --cs[x];
              ans[lo] = x;
              break;
            }
          }
          int pos = lo + 1;
          foreach (x; 1 .. B) {
            foreach (_; 0 .. cs[x]) {
              ans[pos++] = x;
            }
          }
          
          foreach (i; 0 .. N) {
            write(ans[i]);
          }
          writeln;
        } else {
          writeln(-1);
        }
      }
    }
  } catch (EOFException e) {
  }
}