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

int main() {
  int n, m, ans = 0;
  cin >> n >> m;
  vector<int> a(n);
  for (auto& e : a) cin >> e;
  sort(a.begin(), a.end());
  for (int i = 0; i < n; i++) {
    if (a[i] < m) {
      m -= a[i];
      ans++;
    } else if (a[i] == m) {
      ans++;
      break;
    } else if (a[i] > m) {
      break;
    }
  }
  cout << ans << endl;
}