#include<iostream>
#include<algorithm>
using namespace std;
int main(void){
  int n,m;
  int c[11];
  cin>>n;
  cin>>m;
  for(int i = 0; i< n; i++ ){
    cin>>c[i];
  }
  sort( c, c+n );
  int res = 0;
  for(int j = 0; j < n; j++){
    if(m<c[j])break;
    m-=c[j];
    res++;
  }

  cout<<res<<endl;
  return 0;
}