output_description: Print the largest integer that can be formed with exactly N matchsticks under
  the conditions in the problem statement.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M
      A_1 A_2 ... A_M
attempt: def examA():
      A, B = LI()
      if B % A == 0:
          ans = A + B
      else:
          ans = B - A
      print(ans)
      return
  
  
  def examB():
      N, M = LI()
      Flag = [0] * M
      for i in range(N):
          K = LI()
          for j in range(1, K[0] + 1):
              Flag[K[j] - 1] += 1
      ans = 0
      for i in Flag:
          if i == N:
              ans += 1
      print(ans)
      return
  
  
  def gcd(x, y):
      if y == 0:
          return x
      while y != 0:
          x, y = y, x % y
      return x
  
  
  def examC():
      N = I()
      A = LI()
      cur = A[0]
      for i in range(N - 1):
          cur = gcd(cur, A[i + 1])
      ans = cur
      print(ans)
      return
  
  
  def examD():
      N, M = LI()
      A = LI()
      A.sort()
      Matti = [2, 5, 5, 4, 5, 6, 3, 7, 6]
      D = {}
      for a in A:
          D[Matti[a - 1]] = a
      # print(D)
      dp = [-inf] * (N + 10)
      dp[0] = 0
      for i in range(N):
          for matti, num in D.items():
              dp[i + matti] = max(dp[i + matti], dp[i] + 1)
      # print(dp)
      used = []
      i = N
      while i > 0:
          # print(i)
          # input()
          for matti, num in D.items():
              if i - matti < 0:
                  continue
              if dp[i - matti] == dp[i] - 1:
                  used.append(num)
                  i -= matti
      # print(used)
      used.sort(reverse=True)
      ans = "".join(map(str, used))
      print(ans)
      return
  
  
  import sys, copy, bisect, itertools, heapq, math
  from heapq import heappop, heappush, heapify
  from collections import Counter, defaultdict, deque
  
  
  def I():
      return int(sys.stdin.readline())
  
  
  def LI():
      return list(map(int, sys.stdin.readline().split()))
  
  
  def LSI():
      return list(map(str, sys.stdin.readline().split()))
  
  
  def LS():
      return sys.stdin.readline().split()
  
  
  def SI():
      return sys.stdin.readline().strip()
  
  
  global mod, mod2, inf, alphabet
  mod = 10**9 + 7
  mod2 = 998244353
  inf = 10**18
  alphabet = [chr(ord("a") + i) for i in range(26)]
  
  if __name__ == "__main__":
      examD()
  
  
  """
  31 2
  5 8
  """
  
problem_description: Statement
  
  Find the largest integer that can be formed with exactly N matchsticks, under
  the following conditions:
  
    * Every digit in the integer must be one of the digits A_1, A_2, ..., A_M (1 \leq A_i \leq 9).
    * The number of matchsticks used to form digits 1, 2, 3, 4, 5, 6, 7, 8, 9 should be 2, 5, 5, 4, 5, 6, 3, 7, 6, respectively.
samples: [{"input": "20 4\n    3 7 8 4", "output": "777773\n    \n\nThe integer 777773 can be formed with 3 + 3 + 3 + 3 + 3 + 5 = 20 matchsticks,\nand this is the largest integer that can be formed by 20 matchsticks under the\nconditions.\n\n* * *"}, {"input": "101 9\n    9 8 7 6 5 4 3 2 1", "output": "71111111111111111111111111111111111111111111111111\n    \n\nThe output may not fit into a 64-bit integer type.\n\n* * *"}, {"input": "15 3\n    5 4 6", "output": "654"}]