#include <bits/stdc++.h>
using namespace std;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
template <typename T>
inline T GCD(T a, T b) {
  T c;
  while (b != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
template <typename T>
inline T LCM(T a, T b) {
  T c = GCD(a, b);
  a /= c;
  return a * b;
}
template <typename T>
inline T nCr(T a, T b) {
  T i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= (a + 1 - i);
    r /= i;
  }
  return r;
}
template <typename T>
inline T nHr(T a, T b) {
  return nCr(a + b - 1, b);
}
template <typename T>
inline T POW(T a, T b) {
  int i, r = 1;
  for (i = 1; i <= b; i++) {
    r *= a;
  }
  return r;
}
signed main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n, x, a[100];
  cin >> n >> x;
  int sum = 0;
  for (int i = 0; i < (n); ++i) {
    cin >> a[i];
    sum += a[i];
  }
  int ans;
  if (x > sum)
    ans = n - 1;
  else if (x == sum)
    ans = n;
  else {
    int diff = sum - x;
    sort(a, a + n, greater<int>());
    ans = n;
    for (int i = 0; i < (n); ++i) {
      if (diff > a[i]) {
        diff -= a[i];
        ans--;
      } else if (diff == a[i]) {
        diff -= a[i];
        ans--;
        break;
      } else {
        ans--;
        break;
      }
    }
  }
  cout << ans << "\n";
  return 0;
}
