#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<long long, long long>;
long long dx[] = {1, 0, -1, 0};
long long dy[] = {0, 1, 0, -1};
constexpr ll mod = 1e9 + 7;
constexpr ll inf = INT32_MAX / 2;
constexpr ll INF = LLONG_MAX / 2;
constexpr long double eps = DBL_EPSILON;
constexpr long double pi = 3.141592653589793238462643383279;
template <class T>
inline bool chmin(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
ll fact(long long i) {
  if (i == 0) return 1;
  return (fact(i - 1)) * i % mod;
}
ll gcd(ll a, ll b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
long long keta(ll n) {
  if (n == 0) return 1;
  long long count = 0;
  while (n != 0) {
    n /= 10;
    count++;
  }
  return count;
}
bool isprime(ll a) {
  if (a < 2)
    return false;
  else if (a == 2)
    return true;
  else if (a % 2 == 0)
    return false;
  double m = sqrt(a);
  for (long long i = 3; i <= m; i += 2) {
    if (a % i == 0) {
      return false;
    }
  }
  return true;
}
ll ketasum(ll n) {
  ll sum = 0;
  while (n != 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
signed main() {
  long long N, X;
  cin >> N >> X;
  vector<long long> A(N);
  for (long long i = 0; i < (long long)(N); i++) {
    cin >> A.at(i);
  }
  sort((A).begin(), (A).end());
  long long count = 0;
  for (long long i = 0; i < (long long)(N); i++) {
    if (X - A.at(i) >= 0) {
      count++;
      X -= A.at(i);
    } else {
      break;
    }
  }
  long long sum = 0;
  for (long long x : A) {
    sum += x;
  }
  if (sum < X) {
    cout << count - 1 << endl;
  } else {
    cout << count << endl;
  }
}
