N, M = map(int, raw_input().split())
boxes = map(int, raw_input().split())
boxes.sort()

for i in range(1, N+1):
    if M < sum(boxes[:i]):
        ans = i-1
        break
    elif M == sum(boxes[:i]):
        ans = i
    else:
        continue

print ans