import bisect

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

for i in range(1,N):
    W[i]=W[i-1]+W[i]
print(bisect.bisect_right(W,L))