#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("zebughil.in");
ofstream fout("zebughil.out");
int i,j,n,gmax,a[100],v[100],k,ok;
bool cmp(const int &a,const int &b)
{
    return a>b;
}
int main()
{
    while(fin>>n>>gmax)
    {
        for(i=1;i<=n;++i)
        {
            fin>>v[i];
            a[i]=0;
        }
        sort(v+1,v+n+1,cmp);
        k=1;
        for(i=1;i<=n;++i)
        {
            ok=0;
            for(j=1;j<=k;++j)
                if(a[j]+v[i]<=gmax)
                {
                    a[j]+=v[i];
                    ok=1;
                    break;
                }
            if(ok==0)
                a[++k]=v[i];

        }
        fout<<k<<'\n';
    }
    return 0;
}