import bisect
N,M = map(int,input().split())
C = list(map(int,input().split()))
C.sort()

rui = [0]*(N+1)
for i in range(N):
    rui[i+1]=rui[i]+C[i]

p = bisect.bisect_right(rui,M)

print(p-1)