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: from sys import stdin
  
  n, m = [int(x) for x in stdin.readline().rstrip().split()]
  a = [int(x) for x in stdin.readline().rstrip().split()]
  if 1 in a:
      minm = 2
  elif 7 in a:
      minm = 3
  elif 4 in a:
      minm = 4
  elif 2 in a:
      minm = 5
  elif 3 in a:
      minm = 5
  elif 5 in a:
      minm = 5
  elif 6 in a:
      minm = 6
  elif 9 in a:
      minm = 6
  elif 8 in a:
      minm = 7
  order = n // minm
  amari = n % minm
  output = ""
  for i in range(order - 1):
      amari += minm
      if amari >= 6 and 9 in a:
          output += "9"
          amari -= 6
      elif amari >= 7 and 8 in a:
          output += "8"
          amari -= 7
      elif amari >= 3 and 7 in a:
          output += "7"
          amari -= 3
      elif amari >= 6 and 6 in a:
          output += "6"
          amari -= 6
      elif amari >= 5 and 5 in a:
          output += "5"
          amari -= 5
      elif amari >= 4 and 4 in a:
          output += "4"
          amari -= 4
      elif amari >= 5 and 3 in a:
          output += "3"
          amari -= 5
      elif amari >= 5 and 2 in a:
          output += "2"
          amari -= 5
      elif amari >= 2 and 1 in a:
          output += "1"
          amari -= 2
  amari += minm
  if amari == 6 and 9 in a:
      output += "9"
      amari -= 6
  elif amari == 7 and 8 in a:
      output += "8"
      amari -= 7
  elif amari == 3 and 7 in a:
      output += "7"
      amari -= 3
  elif amari == 6 and 6 in a:
      output += "6"
      amari -= 6
  elif amari == 5 and 5 in a:
      output += "5"
      amari -= 5
  elif amari == 4 and 4 in a:
      output += "4"
      amari -= 4
  elif amari == 5 and 3 in a:
      output += "3"
      amari -= 5
  elif amari == 5 and 2 in a:
      output += "2"
      amari -= 5
  elif amari == 2 and 1 in a:
      output += "1"
      amari -= 2
  print(output)
  
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"}]