tyvj 2018

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<vector>
#include<set>
using namespace std;
#define INF 1<<30
int n,w,a[20],rest[100010],ans;
void dfs(int x,int num)
{
      if(num>=ans)
            return ;
      if(x==n+1)
      {
            ans=min(ans,num);
            return ;
      }
      for(int i=1;i<=num;i++)
      {
            if(a[x]+rest[i]<=w)
            {
                  rest[i]+=a[x];
                  dfs(x+1,num);
                  rest[i]-=a[x];
            }
      }
      rest[num+1]+=a[x];
      dfs(x+1,num+1);
      rest[num+1]-=a[x];
      return ;

}
int main()
{
      scanf("%d%d",&n,&w);
      for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
      ans=INF;
      dfs(1,1);
      printf("%d\n",ans);
      return 0;
}