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: # coding: utf-8
  # Your code here!
  
  from collections import defaultdict
  
  N, M = map(int, input().rstrip().split(" "))
  A = sorted(list(map(int, input().rstrip().split(" "))))[::-1]
  
  numbers = {1: 2, 2: 5, 3: 5, 4: 4, 5: 5, 6: 6, 7: 3, 8: 7, 9: 6}
  temp = [False] * 8
  temp_A = []
  for a in A:
      if temp[numbers[a]] == False:
          temp_A.append(a)
          temp[numbers[a]] = True
  A = temp_A
  
  max_numbers = []
  memo = defaultdict(lambda: defaultdict(lambda: [-1, -1]))
  memo2 = defaultdict(lambda: defaultdict(lambda: []))
  
  
  def recursive(n, honsu, sum_numbers, i):
  
      if memo[n][i][0] != -1:
          return memo[n][i][0], memo[n][i][1], memo2[n][i]
      if n == 0:
          return honsu, sum_numbers, [0] * (len(A) - i)
  
      max_honsu = -1
      max_sum_numbers = -1
      max_k = []
      for j in range(i, len(A)):
          a = A[j]
          for k in range(n // numbers[a] + 1):
              return_honsu, return_sum_numbers, return_ks = recursive(
                  n - numbers[a] * k, honsu + k, sum_numbers + a * k, j + 1
              )
  
              if return_honsu > max_honsu:
                  max_honsu = return_honsu
                  max_sum_numbers = return_sum_numbers
                  max_k = [k] + return_ks
              elif return_honsu == max_honsu:
                  if return_sum_numbers > max_sum_numbers:
                      max_sum_numbers = return_sum_numbers
                      max_k = [k] + return_ks
  
      memo[n][i][0] = max_honsu
      memo[n][i][1] = max_sum_numbers
      memo2[n][i] = max_k
  
      return max_honsu, max_sum_numbers, max_k
  
  
  honsu, sum_numbers, _ = recursive(N, 0, 0, 0)
  
  honsu = sorted([[a, x] for a, x in zip(A, memo2[N][0])], key=lambda x: x[0])[::-1]
  for a, x in honsu:
      for _ in range(x):
          print(a, end="")
  
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"}]