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: N, M = map(int, input().split())
  A = list(map(int, input().split()))
  li = [[1, 2], [7, 3], [4, 4], [5, 5], [3, 5], [2, 5], [9, 6], [6, 6], [8, 7]]
  use = []
  Q = [0] * 10
  counter = 0
  for i in li:
      Flag = False
      if i[0] in A:
          Flag = True
          for j in use:
              if j[1] == i[1]:
                  Flag = False
      if Flag:
          use.append(i)
  Q[use[0][0]] = int(N // use[0][1])
  R = N % use[0][1]
  while R != 0:
      if Q[use[counter][0]] == 0 or counter >= M - 1:
          counter -= 1
      else:
          Q[use[counter][0]] -= 1
          R += use[counter][1]
          counter += 1
          Q[use[counter][0]] = int(R // use[counter][1])
          R = R % use[counter][1]
  ans = ""
  for i in [9, 8, 7, 6, 5, 4, 3, 2, 1]:
      ans = ans + str(i) * Q[i]
  print(ans)
  
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"}]