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


using namespace std;

int main()
{
	int N, M;
	cin >> N >> M;
	vector<int> C(N);

	for( int i = 0 ; i < N; i++ ) {
		cin >> C[i];
	}
	sort( C.begin(), C.end() );
	int st = 0;
	while( M > 0 ) {
		if( C[st] > M ) {
			break;
		}
		M -= C[st];
		st++;
	}
	cout << st << endl;


	return 0;
}