#include <fstream>

using namespace std;

ifstream fin("zebughil.in");
ofstream fout("zebughil.out");

const int nmax= 17;

int v[nmax+1], d[(1<<nmax)][nmax+1];

int main(  ) {
    for ( int cnt= 1; cnt<=3; ++cnt ) {
        int n, g;
        fin>>n>>g;
        for ( int i= 1; i<=n; ++i ) {
            fin>>v[i];
        }

        for ( int i= 1; i<=(1<<n)-1; ++i ) {
            d[i][0]= -1;
            for ( int j= 1; j<=n; ++j ) {
                d[i][j]= -1;
                for ( int k= 1; k<=n; ++k ) {
                    if ( (i&(1<<(k-1)))>0 && d[i-(1<<(k-1))][j-1]!=-1 ) {
                        d[i][j]= max(d[i][j], g-v[k]);
                    } else if ( (i&(1<<(k-1)))>0 && d[i-(1<<(k-1))][j]>=v[i] ) {
                        d[i][j]= max(d[i][j], d[i-(1<<(k-1))][j]-v[k]);
                    }
                }
            }
        }

        int sol= -1;
        for ( int i= 1; i<=n && sol==-1; ++i ) {
            if ( d[(1<<n)-1][i]!=-1 ) {
                sol= i;
            }
        }

        fout<<sol<<"\n";
    }

    return 0;
}