#include<bits/stdc++.h>

using namespace std;
using ll=long long;
#define rep2(i, a, n) for(int i = (a); i < (n); i++)
#define rep(i, n) rep2(i,0,n)

int main(){
  cin.tie(nullptr);ios_base::sync_with_stdio(false);
  int n,m,cnt=0,hoge=0;cin>>n>>m;
  int c[n];rep(i,n)cin>>c[i];
  sort(c,c+n);
  int i=0;
  while(i<n&&hoge<=m){
    hoge+=c[i];
    cnt++;
    //cout<<cnt<<" "<<hoge<<" "<<endl;
    i++;
  }
  if(i!=n)cnt--;
  cout<<cnt<<endl;
}