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: ## ABC068-D
  
  ## 途中だけど保存用
  
  N, M = map(int, input().split())
  A = list(map(int, input().split()))
  
  #cost = dict([(1,2),(2,5),(3,5),(4,4),(5,5),(6,6),(7,3),(8,7),(9,6)])
  cost = [(1,2),(7,3),(4,4),(5,5),(3,5),(2,5),(9,6),(6,6),(8,7)] ## priority order
  
  ## 使う可能性のある数字だけを取り出す
  ## (5,3,2),(9,6) は上位数だけで十分
  ## 2個の数字で代用できる場合はそちらを用いる: 4 --> 11
  B = []
  B_cost = []
  for i in range(len(cost)):
    if cost[i][1] in B_cost:
      continue
    elif cost[i][1] == 4 and 2 in B_cost:
      continue
    elif cost[i][1] == 6 and (2 in B_cost or 3 in B_cost):
      continue
    else:
      B.append((cost[i]))
      B_cost.append(cost[i][1])
      
  solver = []
  n_num = 0
  upper_n_num = (N + B[0][1]) // B[0][1]
  n_lowcost = upper_n_num
  while True:
    
    
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"}]