#include <iostream>
#include <vector>
#include <algorithm>

#define ALL(x) (x).begin(),(x).end()

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(ALL(c));
    int ans = 0;
    for(int i = 0;i < n;i++){
        if(m < c[i])break;
        m -= c[i];
        c[i] = 0;
        ans++;
    }
    cout << ans << endl;
    return 0;
}