#include<iostream>
#include<algorithm>
using namespace std;
 void quick_sort(long long q[], long long l, long long r)
{
	if (l >= r)return;
	long long i = l - 1, j = r + 1,x=q[l];
	while (i < j)
	{
		do i++; while (q[i] > x);
		do j--; while (q[j] < x);
		if (i < j)swap(q[i], q[j]);
	}
	quick_sort(q, l, j);
	quick_sort(q, j + 1, r);
}
int main()
{
	long long n, h[100]; long long s,sum=0; cin >> n >> s;
	for (long long i = 0; i < n; i++)cin >> h[i];
	quick_sort(h, 0, n - 1);
	for (long long i = 0; i < n; i++)
	{
		sum += h[i];
		if (sum >= s)
		{
			cout << i + 1;
			return 0;
		}
	}
}