#include<iostream>

#include<cstdio>

#include<cstring>

#include<cctype>

#include<cmath>

#include<algorithm>

using namespace std;

inline long long read(){

    long long num=,f=;

    char ch=getchar();

    while(!isdigit(ch)){

        if(ch=='-')    f=-;

        ch=getchar();

    }

    while(isdigit(ch)){

        num=num*+ch-'';

        ch=getchar();

    }

    return num*f;

}

long long w[];

int Max;

struct Node{

    long long cnt,v;

}f[];

int n,W;

inline Node operator +(const Node a,const int b){

    return a.v+b<=W?(Node){a.cnt,a.v+b}:(Node){a.cnt+,b};

}

inline bool operator <(const Node a,const Node b){

    if(a.cnt!=b.cnt)    return a.cnt<b.cnt;

    return a.v<b.v;

}

inline Node min(Node a,Node b){    return a<b?a:b;    }

int main(){

    n=read(),W=read();

    Max=(<<n)-;

    for(int i=;i<=n;++i)    w[i]=read();

    for(int i=;i<=Max;++i){

        f[i]=(Node){,W};

        for(int j=;j<=n;++j){

            if(((<<(j-))&i)==)    continue;

            f[i] = min(f[i],f[(<<(j-))^i]+w[j]);

        }

    }

    printf("%lld",f[Max].cnt+);

    return ;

}