n, k = map(int, input().split()) dist = list(map(int, input().split())) # 检查是否有无法通过的路段 for d in dist: if d > n: print("No Solution") exit() current_fuel = n refuel_count = 0 for i in range(k + 1): # 共 k+1 段路 if current_fuel >= dist[i]: current_fuel -= dist[i] else: # 在当前起点（第i个加油站）加油 refuel_count += 1 current_fuel = n - dist[i] # 加满后跑这段路 print(refuel_count)