#include <bits/stdc++.h>

using namespace std;

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

int dp[(1 << 17) + 5], v[20], msk, submask, i;
long long sum[(1 << 17) + 5];

int main()
{
    int t = 3;
    while(t--)
    {
        int n, g;
        fin >> n >> g;

        for(i = 1; i <= n; ++i)
            fin >> v[i];

        for(msk = 0; msk < (1 << n); ++msk)
            sum[msk] = -1;
        sum[0] = 0;
        for(msk = 1; msk < (1 << n); ++msk)
        {
            for(i = 0; i < n; ++i);
        }
        for(msk = 1; msk < (1 << n); ++msk)
        {
            dp[msk] = (1 << 26);
            for(submask = msk; submask; submask = (submask - 1) & msk)
                if(sum[submask] <= g)
                    dp[msk] = min(dp[msk], dp[msk ^ submask] + 1);
        }
        fout << dp[(1 << n) - 1] << '\n';
    }
    return 0;
}