#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int main()
{
int n, w;
cin >> n >> w;
vector<int> a;
for (int i = 0;i < n;++i)
{
int x;
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
int index = a.size() - 1;
int cnt = 0;
while (true)
{
if (w == 0)
{
break;
}
while (w < a[index])
{
index--;
}
w -= a[index];
cnt++;
}
cout << cnt;
return 0;
}