m = int(input())
n = int(input())
v = []
w = []
for _ in range(n):
a = int(input())
v.append(a)
w.append(a)
f = [[0 for _ in range(m+1)]for _ in range(n)]
for i in range(n):
for j in range(m+1):
f[i][j] = f[i-1][j]
if j >= v[i]:
f[i][j] = max(f[i][j], f[i-1][j-v[i]] + w[i])
print(m-f[n-1][m])