#include <bits/stdc++.h>
using namespace std;
int a [3000];
int main (){

    ifstream fin ("mars.in");
	ofstream fout ("mars.out");
	int n, m;
	fin >> n >> m;
	for (int i = 0; i < n; i ++) fin >> a [i];
	sort (a, a + n);
	int i;
	for (i = 0; i < n && m >= 0; i ++){
        m -= a [i];
	}
	if (m < 0) fout << i - 1 << endl;
	else fout << n << endl;

return 0;
}