#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)

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