#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main(void) {
	int n, m, a;
	cin >> n >> m;
	vector<int> boxes(n);
	for (int i = 0; i < n; ++i) cin >> boxes[i];
	sort(boxes.begin(), boxes.end());
	int cnt = 0;
	for (int i = 0; i < n; ++i) {
		if (m >= boxes[i]) ++cnt;
		else break;
		m -= boxes[i];
	}
	cout << cnt << endl;
	return 0;
}