#include<iostream>
#include<algorithm>
using namespace std;
int main(){
	int vet[11], n, m;
	cin >> n >> m;
	for (int i = 0; i < n; i++){ cin >> vet[i]; }
	sort(vet, vet + n);
	int empty;
	for (empty = 0; empty < n; empty++){
		m -= vet[empty];
		if (m < 0) break;
	}
	cout << empty << endl;
	return 0;
}