#include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;

#define MOD 1000000007

int main() {
  int n, m;
  cin >> n >> m;
  vector<int> c(n);
  for (int i = 0; i < n; ++i) {
    cin >> c[i];
  }
  sort(c.begin(), c.end());
  int ans = 0;
  for (int i = 0; i < n; ++i) {
    int t = min(c[i], m);
    c[i] -= t;
    m -= t;
    if (c[i] == 0) ans++;
  }
  cout << ans << endl;
  return 0;
}