output_description: Print the minimum number of coins in a line.
input_description: n m
      d1 d2 ... dm
      
  
  Two integers n and m are given in the first line. The available denominations
  are given in the second line.
attempt: n, m = map(int, input().split())
  a = [i for i in range(n + 1)]
  for i in list(map(int, input().split())):
      for j in range(i, n + 1):
          a[j] = min(a[j - i] + 1, a[j])
  print(a[-1])
  
problem_description: Coin Changing Problem
  
    
  
  Find the minimum number of coins to make change for n cents using coins of
  denominations d1, d2,.., dm. The coins can be used any number of times.
samples: [{"input": "55 4\n    1 5 10 50", "output": "2"}, {"input": "15 6\n    1 2 7 8 12 50", "output": "2"}, {"input": "65 6\n    1 2 7 8 12 50", "output": "3"}]