#include <bits/stdc++.h>
using namespace std;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
template <class T = int>
T in() {
  T x;
  cin >> x;
  return (x);
}
template <class T>
void print(T& x) {
  cout << x << '\n';
}
const int MOD = (int)1e9 + 7;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMint() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  if (a > b) {
    swap(a, b);
  }
  return gcd(a, b % a);
}
long long lcm(long long a, long long b) {
  long long g;
  g = gcd(a, b);
  return a * b / g;
}
int main() {
  int N = in();
  long long x = in();
  vector<long long> a;
  long long temp;
  for (int i = 0; i < (N); ++i) {
    cin >> temp;
    a.push_back(temp);
  }
  int ans;
  ans = 0;
  sort(a.begin(), a.end());
  for (int i = 0; i < (N); ++i) {
    if (x - a[i] > 0) {
      ans++;
      x -= a[i];
    } else if (x - a[i] < 0) {
      break;
    } else {
      break;
    }
    if (i == N - 1 && x > 0) ans--;
  }
  print(ans);
}
