#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
    int N,M,cnt=0;
    cin >> N >> M;
    vector<int> C(N+1);
    for(int i=0;i<N;i++)cin >> C[i];
    C[N]=1e7;
    sort(C.begin(),C.end());
    
    for(int i=0;i<=N;i++){
        M-=C[i];
        if(M<0){cnt=i;break;}
    }
    cout << cnt << endl;
    return 0;
}