#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
  int n, m;
  scanf("%d %d", &n, &m);
  vector<int> c(n);
  for(int i = 0; i < n; i++){
    scanf("%d", &c[i]);
  }
  sort(c.begin(), c.end());
  for(int i = 0; i < n; i++){
    int tmp = c[i];
    c[i] = max(0, c[i] - m);
    m -= tmp;
  }
  printf("%d\n", upper_bound(c.begin(), c.end(), 0) - lower_bound(c.begin(), c.end(), 0));
  return 0;
}