#include <iostream>
#include <cstdio>
#include <iomanip>
#include <cmath>
#include <algorithm>
using namespace std;
int n,w,a[20];
int ans=20,b[20];
bool cmp(int x,int y)
{
	if(x>y)
		return true;
	else
		return false;
}
void dfs(int now,int num)
{
	if(num>=ans)
		return;
	if(now>=n+1)
	{
		ans=min(ans,num);
		return;
	}
	for(int i=1;i<=num;i++)
	{
		if(b[i]+a[now]<=w)
		{
			b[i]+=a[now];
			dfs(now+1,num);
			b[i]-=a[now];
		}
	}
	b[num+1]+=a[now];
	dfs(now+1,num+1);
	b[num+1]=0;
}
int mao()
{
	freopen("koneko.in","r",stdin);
	freopen("koneko.out","w",stdout);
	cin>>n>>w;
	for(int i=1;i<=n;i++)
		cin>>a[i];
	sort(a+1,a+n+1,cmp);
	dfs(1,0);
	cout<<ans;
	return 0;
}
int huhu=mao();
int main(){;}