#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, x;
  cin >> n >> x;
  vector<int> a(n, 0);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  int count = 0;
  while (a[count] <= x && count < n) {
    x -= a[count];
    count++;
  }
  cout << count << endl;
  return 0;
}
