#include <bits/stdc++.h>
using namespace std;

const int N = 25;

int a[N], cab[N];
int n, w, ans;

void dfs(int cnt, int now) {
    if(cnt >= ans) return;
    if(now == n) {
        ans = cnt;
        return;
    }
    for(int i = 1; i <= cnt; i ++ ) {
        if(cab[i] + a[now] <= w) {
            cab[i] += a[now];
            dfs(cnt, now + 1);
            cab[i] -= a[now];
        }
    }
    cab[cnt + 1] += a[now];
    dfs(cnt + 1, now + 1);
    cab[cnt + 1] -= a[now];
}

int main() {
    cin >> n >> w;
    for(int i = 0; i < n; i ++ ) cin >> a[i];
    sort(a, a + n, greater{});
    ans = n;
    dfs(1, 0);
    cout << ans << endl;
    return 0;
}