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