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: arr = [10, 2, 5, 5, 4, 5, 6, 3, 7, 6]
  N, M = map(int, input().split())
  src = sorted(list(map(int, input().split())), key=lambda x: arr[x])
  dim = 0
  num = 0
  min_num = 0
  for i in src:
      if arr[min_num] > arr[i]:
          if min_num <= i:
              min_num = i
  for i in src:
      tmp = 1 + (N - arr[i]) // arr[min_num]
      if dim <= tmp and num < i:
          dim = tmp
          num = i
  s = str(num)
  cnt = N - arr[num]
  cnt_dim = 1
  while cnt_dim + 1 < dim:
      s += str(min_num)
      cnt -= arr[min_num]
      cnt_dim += 1
  for i in src:
      if cnt == arr[i]:
          if i <= min_num:
              s += str(i)
              break
          else:
              s = s[:1] + str(i) + s[1:]
              break
  print(s)
  
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"}]