#include<iostream>  
#include<cstdio>
#include<cmath> 
#include<cstring>  
#include<algorithm>  
using namespace std;
int n,w,a[50],s=0,t[50],k;
bool bk=0;
inline void dfs(int sum){
	if(sum==n+1){bk=1;return;}
	for(int i=1;i<=k;i++){
		if(t[i]+a[sum]<=w){
			t[i]+=a[sum];
			dfs(sum+1);
			t[i]-=a[sum];
		}
		if(bk)return;
	}
	return;
}
inline bool nb(int a1,int a2){return a1>a2;}
int main(){
	freopen("koneko.in","r",stdin);
	freopen("koneko.out","w",stdout);
	scanf("%d%d",&n,&w);
	for(int i=1;i<=n;i++){scanf("%d",&a[i]);s+=a[i];}
	sort(a+1,a+n+1,nb);
	for(k=s/w;k<=n;k++){
		dfs(1);
		if(bk){printf("%d",k);return 0;}
	}
	return 0;
}