#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
    int n, m;
    while (cin>>n>>m) {
        vector<int> c(n);
        for(int& v: c) cin>>v;
        sort(begin(c), end(c));
        for(int i=1;i<n;++i) c[i]+=c[i-1];
        cout<<upper_bound(begin(c), end(c), m)-begin(c)<<endl;
    }
}