#include <cstdio>

 #include <iostream>

 int n, m, w;

 int a[];

 struct qwq

 {

     int cnt, v;

     qwq(int cnt = , int v = ) : cnt(cnt), v(v) {}

 }f[ << ];

 inline qwq operator + (const qwq x, const int d)

 {

     return x.v + d <= w ? qwq(x.cnt, x.v + d) : qwq(x.cnt + , d);

 }

 inline bool operator < (const qwq x, const qwq y)

 {

     return x.cnt == y.cnt ? x.v < y.v : x.cnt < y.cnt;

 }

 inline qwq min(qwq x, qwq y)

 {

     return x < y ? x : y;

 }

 inline int read()

 {

     int x = , f = ;

     char ch = getchar();

     for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = -;

     for(; isdigit(ch); ch = getchar()) x = (x << ) + (x << ) + ch - '';

     return x * f;

 }

 int main()

 {

     int i, S;

     n = read();

     w = read();

     m = ( << n) - ;

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

     for(S = ; S <= m; S++)

     {

         f[S] = qwq(1e9, w);

         for(i = ; i <= n; i++)

         {

             if(!(( << i - ) & S)) continue;

             f[S] = min(f[S], f[( << i - ) ^ S] + a[i]);

         }

     }

     printf("%d\n", f[m].cnt + );

     return ;

 }