#include<bits/stdc++.h>
#pragma GCC optimize("O3")

using namespace std;

const int NMAX = 18, DPMAX = (1 << 17);
int n, g, v[NMAX];
pair<int, int> dp[DPMAX];

void query()
{
    cin >> n >> g;
    for(int i = 0; i < n; i++)
        cin >> v[i];
    
    pair<int, int> cpy;
    for(int mask = 1; mask < (1 << n); mask++)
    {
        dp[mask].first = n + 1;
        for(int i = 0; i < n; i++)
        {
            if(mask & (1 << i))
            {
                cpy = dp[mask ^ (1 << i)];
                if(cpy.second + v[i] > g)
                    cpy = {cpy.first + 1, v[i]};
                else
                    cpy.second += v[i];
                
                if(cpy.first < dp[mask].first)
                    dp[mask] = {cpy.first, cpy.second};
                else if(cpy.first == dp[mask].first && cpy.second < dp[mask].second)
                    dp[mask].second = cpy.second;
            }
        }
    }

    cout << dp[(1 << n) - 1].first + 1;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    freopen("zebunghil.in", "r", stdin);
    freopen("zebunghil.out", "w", stdout);

    int t = 3;
    while(t--)
    {
        query();
        cout << "\n";
    }
}