#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
    int n, m;
    cin >> n >> m;
    vector<int> c(n);
    for(int i = 0; i < n; ++i){
        cin >> c[i];
    }
    sort(c.begin(), c.end());
    int count = 0;
    for(int i = 0; i < n; ++i){
        if(m - c[i] >= 0){
            ++count;
            m -= c[i];
        }else{
            break;
        }
    }
    
    cout << count;
    
    return 0;
}