program match_matching
  implicit none
  integer              :: n, m, b(9), i, j, d, r
  integer, allocatable :: a(:), dp(:)
  character(16384)     :: answer
  read(*,*) n, m
  allocate(a(m),dp(0:n))
  read(*,*) a(:)
  b = (/2,5,5,4,5,6,3,7,6/)
  call reverse_sort(m,a)
  dp = -1
  dp(0) = 0
  do i = 2, n
    d = -1
    do j = 1, m
      if (i-b(a(j)) .ge. 0) then
        if (dp(i-b(a(j))) .gt. d) d = dp(i-b(a(j)))
      end if
      if (d .lt. 0) then
        dp(i) = -1
      else
        dp(i) = d + 1
      end if
    end do
  end do
  r = n
  i = 1
  answer = ''
  do while (r .gt. 0)
    do j = 1, m
      if (r-b(a(j)) .ge. 0) then
        if (dp(r-b(a(j))) .eq. dp(r)-1) then
          answer(i:i) = achar(48+a(j))
          r = r - b(a(j))
          i = i + 1
          exit
        end if
      end if
    end do
  end do
  deallocate(a,dp)
  write(*,'(a)') answer(1:i)
  stop

contains

  subroutine reverse_sort(m,a)
    implicit none
    integer, intent(in)    :: m
    integer, intent(inout) :: a(m)
    integer                :: i, j
    do i = m-1, 1, -1
      do j = 1, i
        if (a(j) .lt. a(j+1)) call swap(a(j),a(j+1))
      end do
    end do
    return
  end subroutine reverse_sort

  subroutine swap(a,b)
    implicit none
    integer, intent(inout) :: a, b
    integer                :: c
    c = a
    a = b
    b = c
    return
  end subroutine swap

end program match_matching