#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
	int N, M;
	cin >> N >> M;
	vector<int> v(N);
	for (int i = 0; i < N; i++) {
		cin >> v[i];
	}
	sort(v.begin(), v.end());
	for (int i = 0; i < N;i++) {
		M -= v[i];
		if (M == 0) { cout << i + 1 << endl; return 0; }
		else if (M < 0) {
			cout << i << endl; return 0;
		}
	}
	return 0;
}