#include <iostream>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <algorithm>
#include <string>
#include <map>
using namespace std;
#define ll long long

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 count = 0;
  int id = 0;
  while(1) {
    if(id >= n || c[id] > m) break;
    m -= c[id];
    c[id++] = 0;
    count++;

  }
  cout << count << endl;

}