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

int main(){
   int n,m;
   cin >> n >> m;
   int c[n];
   for(int i = 0;i < n;i++) cin >> c[i];
   stable_sort(c,c + n);
   for(int i = 0;i < n;i++){
      if(m == c[i]){
         cout << i + 1 << endl;
         return 0;
      }
      if(m < c[i]){
         cout << i << endl;
         return 0;
      }
      m -= c[i];
   }
}