#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;

int main()
{
  int n, x;cin>> n>> x;
  int a[n];

  rep(i, n) {
    cin>>a[i];
  }

  sort(a,a+n);

  int ans = 0;
  rep(i, n) {
    if(x >= a[i]) {
      x = x-a[i];
      ans++;
    }
  }
  if (x > 0 && ans === 0) ans--;

  cout << ans << endl ;
  return 0;
}