#include <iostream>
#include <algorithm>
using namespace std;


int main()
{
  int n,m = 0,count = 0;
    cin>>n>>m;
    int c[n];
    for (int i = 0; i < n; ++i)
    {
      cin>>c[i];
    }

    sort(c,c+(n));
    for(int i=0; i<n; ++i)
    {
      m = m - c[i];
      if (m > 0) {
        count++;
        continue;
      }else{
        if (m == 0) {
          count++;
          break;
        }else{
          break;
        }
      }
    }

    cout<<count<<endl;
    return 0;
}