#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265358979323846;
int ctoi(const char c) {
  if ('0' <= c && c <= '9') return (c - '0');
  return -1;
}
vector<int> input(int n) {
  vector<int> vec(n);
  for (int i = 0; i < n; i++) {
    cin >> vec.at(i);
  }
  return vec;
}
void output(vector<int> vec) {
  for (int i = 0; i < vec.size(); i++) {
    cout << vec[i] << " ";
  }
  return;
}
vector<vector<int>> input(int n, int m) {
  vector<vector<int>> table(n, vector<int>(m));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      cin >> table.at(i).at(j);
    }
  }
  return table;
}
void output(vector<vector<int>> table) {
  for (int i = 0; i < table.size(); i++) {
    for (int j = 0; j < table.at(0).size(); j++) {
      cout << table.at(i).at(j) << " ";
    }
    cout << endl;
  }
}
long long perm(int n, int r) {
  if (n < r) {
    cout << "error" << endl;
    return 0;
  }
  long long perm = 1;
  for (int i = n; i > n - r; i--) {
    perm *= i;
  }
  return perm;
}
long long comb(int n, int r) {
  if (n < r) {
    cout << "error" << endl;
    return 0;
  }
  long long comb = perm(n, r);
  for (int i = r; i > 0; i--) {
    comb /= i;
  }
  return comb;
}
long long homo(int n, int r) { return comb(n + r - 1, n - 1); }
long long fact(int n) {
  long long fact = 1;
  for (int i = n; i > 0; i--) {
    fact *= i;
  }
  return fact;
}
int gcd(int a, int b) {
  if (a % b == 0) {
    return (b);
  } else {
    return (gcd(b, a % b));
  }
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool isprime(int n) {
  if (n < 2)
    return false;
  else if (n == 2)
    return true;
  else if (n % 2 == 0)
    return false;
  for (int i = 3; i <= sqrt(n); i += 2) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
vector<long long> divisors(long long N) {
  vector<long long> res;
  for (long long i = 1; i * i <= N; ++i) {
    if (N % i == 0) {
      res.push_back(i);
      if (N / i != i) res.push_back(N / i);
    }
  }
  sort(res.begin(), res.end());
  return res;
}
vector<pair<long long, long long>> prime_factorize(long long N) {
  vector<pair<long long, long long>> res;
  for (long long a = 2; a * a <= N; ++a) {
    if (N % a != 0) continue;
    long long ex = 0;
    while (N % a == 0) {
      ++ex;
      N /= a;
    }
    res.push_back({a, ex});
  }
  if (N != 1) res.push_back({N, 1});
  return res;
}
void sayYes(bool f) {
  if (f) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}
void sayYES(bool f) {
  if (f) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}
int main() {
  int n, x, cnt = 0;
  cin >> n >> x;
  vector<int> a = input(n);
  sort(a.begin(), a.end());
  for (int i = 0; i < n; ++i) {
    if (x >= a[i]) {
      cnt++;
      x -= a[i];
    } else {
      break;
    }
  }
  cout << cnt << "\n";
}
