n_, k_ = input().split()
n = int(n_)
k = list(map(int, k_))
c = [0] + list(map(int, input().split()))
if n < len(k):
    print(-1)
    exit()

def fill_rest(s, c):
    for i, cnt in enumerate(c):
        for _ in range(cnt):
            s.append(str(i))
    return

s = []
if n > len(k):
    fill_rest(s, c)
    ans = ''.join(map(str, s))
    print(ans)
    exit()


def dame(i):
    while i:
        i -= 1
        c[s.pop()] += 1
        x = k[i]
        for d in range(x + 1, 10):
            if c[d]:
                s.append(d)
                c[d] -= 1
                fill_rest(s, c)
                ans = ''.join(map(str, s))
                print(ans)
                exit(0)
    print(-1)
    exit()

for i in range(n):
    x = k[i]
    if c[x]:
        s.append(x)
        c[x] -= 1
        continue
    for d in range(x + 1, 10):
        if c[d]:
            s.append(d)
            c[d] -= 1
            fill_rest(s, c)
            ans = ''.join(map(str, s))
            print(ans)
            exit(0)
    dame(i)
else:
    dame(n)