import sys
sys.setrecursionlimit(600000)


def main():
    N, K = input().split()
    N = int(N)
    K = list(map(int, K))
    c = list(map(int, input().split()))

    # M_cand = inf
    # M_cand_list = []
    # # 最上位の桁の数値が違う中での最小をまず求める
    # for idx in range(int(K[0]), 9):
    #     if c[idx] > 0:
    #         M_cand_list.append(idx+1)
    # else:
    #     pass

    # if M_cand_list:
    #     c_copy = c.copy()
    #     c_copy[M_cand_list[0]-1] -= 1
    #     for num, ctr in enumerate(c, 1):
    #         for _ in range(ctr):
    #             M_cand_list.append(num)

    # 最上位の桁が同じ範囲での最小を求める
    def calc_min_M(digit_idx: int, rest: tuple[int, ...]) -> list[int]:
        if digit_idx == N - 1:
            for n, v in enumerate(rest, 1):
                if n <= K[-1]:
                    continue
                if v == 0:
                    continue
                return [n]
            return [-1]

        if rest[K[digit_idx] - 1] > 0:
            new_rest = list(rest)
            new_rest[K[digit_idx] - 1] -= 1
            res = calc_min_M(digit_idx + 1, tuple(new_rest))
            if res != [-1]:
                res.append(K[digit_idx])
                return res
        min_over_n = -1
        for n, v in enumerate(rest, 1):
            if n <= K[digit_idx]:
                continue
            if v > 0:
                min_over_n = n
                break
        else:
            return [-1]

        res = []
        for n, v in reversed(list(enumerate(rest, 1))):
            if n == min_over_n:
                for _ in range(v - 1):
                    res.append(n)
            else:
                for _ in range(v):
                    res.append(n)
        res.append(min_over_n)
        return res

    ans = calc_min_M(0, tuple(c))
    if ans == [-1]:
        print(-1)
    else:
        print("".join(map(str, reversed(ans))))


if __name__ == "__main__":
    main()