#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <functional>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <string>

using namespace std;

int main() {
  int n, m;
  cin >> n >> m;
  int c[n];
  for (int i = 0; i < n; i++) {
    cin >> c[i];
  }
  sort(c, c+n);
  int cnt = 0;
  for (int i = 0; i < n; i++) {
    m -= c[i];
    if (m == 0) {
      std::cout << i+1 << std::endl;
      return 0;
    }else if (m < 0) {
      std::cout << i << std::endl;
      return 0;
    }
  }
  std::cout << 0 << std::endl;
  return 0;
}