import bisect

L = int(input())
N = int(input())
W_l = list(map(int, input().split()))
W_l.sort()

r_W_l = [0 for i in range(N)]
r_W_l[0] = W_l[0]
for i in range(1, N):
	r_W_l[i] = W_l[i] + r_W_l[i-1]

ans = bisect.bisect_right(r_W_l, L)
print(ans)