#include <iostream>
#include <queue>
#include <functional>
using namespace std;

int main()
{
	int N, M, t;
	cin >> N >> M;
	priority_queue<int, vector<int>, greater<int> > pq;
	for (int i = 0; i < N; i++) 
		pq.push((cin >> t, t));
	
	while (!pq.empty()) {
		if (M < pq.top()) break;
		M -= pq.top();
		pq.pop();
	}

	cout << N - pq.size() << endl;
	
	return 0;
}