import java.io.PrintWriter
import java.util.*
import kotlin.math.*

fun PrintWriter.solve() {
    val n = nextInt()
    val k = next()
    val c = Array(9) { nextInt() }
    if (k.length > n) {
        println(-1)
        return
    }
    val s = "0".repeat(n - k.length) + k
    var last = -1
    val deque = ArrayDeque<Char>()
    fun output() {
        while (deque.isNotEmpty()) {
            print(deque.pollFirst())
        }
        for (j in 0 until 9) {
            print(('1' + j).toString().repeat(c[j]))
        }
        println()
        return
    }
    for (i in 0 until n) {
        last = i
        if (s[i] == '0') {
            output()
            return
        } else if (c[s[i] - '1'] > 0) {
            c[s[i] - '1']--
            deque.addLast(s[i])
            last++
        } else {
            for (j in s[i] - '1' + 1 until 9) {
                if (c[j] > 0) {
                    deque.add('1' + j)
                    c[j]--
                    output()
                    return
                }
            }
            break
        }
    }
    for (i in last - 1 downTo 0) {
        val d = deque.pollLast()
        c[d - '1']++
        for (j in d - '1' + 1 until 9) {
            if (c[j] > 0) {
                deque.add('1' + j)
                c[j]--
                output()
                return
            }
        }
    }
    println(-1)
}

fun main() {
    val writer = PrintWriter(System.out, false)
    writer.solve()
    writer.flush()
}

// region Scanner
private var st = StringTokenizer("")
private val br = System.`in`.bufferedReader()

fun next(): String {
    while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())
    return st.nextToken()
}

fun nextInt() = next().toInt()
fun nextLong() = next().toLong()
fun nextLine() = br.readLine()
fun nextDouble() = next().toDouble()
// endregion