#include <iostream>
#include <algorithm>
using namespace std;


int main()
{
	int n,m,t = 0,count = 0;
	cin>>n>>m;
	int c[n];
	for (int i = 0; i < n; ++i)
	{
		cin>>c[i];
	}

	sort(c,c+(n));
	int ctt = 0 - m;
	for (; ctt <= 0; ++t)
	{
		count++;
		ctt += c[t];
	}

	cout<<count-1<<endl;
	return 0;
}