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()))
  
  
  def gcd(a, b):
      while b:
          a, b = b, a % b
      return a
  def lcm(a, b):
      return a * b // gcd(a, b)
  
  L = [2,5,5,4,5,6,3,7,6]
  l_A = [L[A[i] for i in range(len(A))]
  c_m = 0
  mi = min(l_A)
  ma = max(l_A)
  if mi == 5:
      c_m = 5
  elif mi == 6:
      c_m = 9
  else:
      c_m = L.index(mi) + 1
  
  s = list(set(l_A)).sort()
  
  if N % mi == 0:
      print(str(c_m)*(N//mi))
  
  lest = (N % mi) + mi
  if lest in l_A:
      lest_c = l_A[l_A.index(lest)]
      if mi < lest_c:
          print(str(lest_c)+str(mi)*((N//mi)-1))
      else:
          print(str(mi)*((N//mi)-1)+str(lest_c))
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"}]