#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main(int argc, char** argv)
{
	int n,m; cin >> n >> m;
	vector<int> box;
	for (int ii=0; ii<n; ii++) {
		int inp; cin >> inp;
		box.push_back(inp);
	}
	sort(box.begin(), box.end());

	int res = 0;
	for (int ii=0; ii<n; ii++) {
		if (m>=box[ii]) {
			m -= box[ii];
			++ res;
		}
		else {
			break;
		}
	}
	cout << (res)   << endl;
	return 0;
}