L = int(input())
N = int(input())

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

sum_of_w = 0

for n in range(N):
    sum_of_w += W[n]

while(1):
    if (sum_of_w <= L):
        break
    else:
        sum_of_w -= W[0]
        W.pop(0)

print(len(W))