A

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <vector>
#include <array>
#include <set>
#include <map>

using namespace std;

#define int long long

const long long INF = 1e18 + 7;
const int MAXN = 1e1 + 100;
const int N = 3e5 + 10;
const int MOD = 1e9 + 7;

pair<int, int> dp[1 << 20];

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n, w;
    cin >> n >> w;
    vector<int> a(n);
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }

    for (int mask = 0; mask < (1 << n); ++mask) {
        dp[mask] = {INF, INF};
    }

    dp[0] = {0, 0};
    for (int mask = 0; mask < (1 << n); ++mask) {
        for (int i = 0; i < n; ++i) {
            if (mask & (1 << i)) {
                continue;
            }
            int f, s;
            if (dp[mask].second + a[i] < w) {
                f = dp[mask].first;
                s = dp[mask].second + a[i];
            } else if (dp[mask].second + a[i] > w) {
                f = dp[mask].first + 1;
                s = a[i];
            } else if (dp[mask].second + a[i] == w) {
                f = dp[mask].first + 1;
                s = 0;
            }
            dp[mask | (1 << i)] = min(dp[mask | (1 << i)], {f, s});
        }
    }
    cout << dp[(1 << n) - 1].first + (dp[(1 << n) - 1].second? 1: 0);
}