fact=[1]*17
for i in range(1,17):
  fact[i]=fact[i-1]*i
def f(d,s):
  c=d.copy()
  if len(s)==0:
    return 1
  cnt=0
  if s[0]=='0':
    return 0
  m=sum(c)-1
  for i in range(int(s[0])-1):
    if c[i]>0:
      num=fact[m]
      for j in range(9):
        if i!=j:
          num//=fact[c[j]]
        else:
          num//=fact[c[i]-1]
      cnt+=num
  if c[int(s[0])-1]==0:
    return cnt
  c[int(s[0])-1]-=1
  return cnt+f(c,s[1:])

def is_ok(arg):
  if f(d,str(arg))>x:
    return True
  else:
    return False
def bisect(ng, ok):
  while (abs(ok - ng) > 1):
      mid = (ok + ng) // 2
      if is_ok(mid):
          ok = mid
      else:
          ng = mid
  return ok

def g(c):
  ans=''
  for i in range(9):
    for j in range(c[i]):
      ans+=str(i+1)
  return ans

for _ in range(1):
  n,k=map(int,input().split())
  k=str(k)
  d=list(map(int,input().split()))
  if len(k)>n:
    print(-1)
  elif len(k)<n:
    print(g(d))
  else:
    x=f(d,str(k))
    y=bisect(10**(n-1),10**n)
    if y!=10**n:
      print(y)
    else:
      print(-1)