n,m=map(int,input().split());cnt=0
a=sorted(map(int,input().split()))
while m>0 and sum(a)>0:
    d=min(m,a[cnt])
    m-=d
    a[cnt]-=d
    if a[cnt]==0:
        cnt+=1
print(a.count(0))