#include <cstdio>
#include <cstring>
#include <algorithm>

typedef long long ll;

ll fac[15], cnt[15];

ll qpow(ll a, ll b) {
    ll ret = 1;
    while (b) {
        if (b & 1) {
            ret *= a;
        }
        a *= a;
        b >>= 1;
    }
    return ret;
}

void test() {
    ll sum = 0;
    fac[0] = 1;
    for (ll i = 1; i <= 13; i++) {
        fac[i] = fac[i - 1] * i;
    }
    for (ll i = 1; i <= 12; i++) {
        sum += (fac[12] / fac[12 - i] / fac[i]) * qpow(i + 1, 12 - i);
    }
    printf("%lld\n", sum);
}

int re() {
    char ch = 0;
    int s = 0, t = 0;
    while (ch < '0' || ch > '9') {
        if (ch == '-') t = 1;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        s = (s << 1) + (s << 3) + (ch ^ 48);
        ch = getchar();
    }
    return t ? ~s + 1 : s;
}

int main() {
    int n = re();
    int w = re();
    int kind = 0;
    bool used[15];
    int time[15];
    int mx[15];
    int cnt[15];
    memset(cnt, 0, sizeof(cnt));
    memset(used, 0, sizeof(used));
    memset(time, 0, sizeof(time));
    for (int i = 1; i <= n; i++) {
        int len = re();
        cnt[len]++;
    }
    std::sort(cnt + 1, cnt + 14, [](const int &a, const int &b) -> bool {
        return a > b;
    });
    for (int i = 1; i <= 14; i++) {
        // printf("cnt[%d] = %d\n", i, cnt[i]);
        if (!cnt[i]) {
            kind = i - 1;
            break;
        }
    }
    // printf("kind: %d\n", kind);
    int stk[15], top = 0;
    auto dfs2 = [&](auto &&self, int k, int tot) -> bool {
        /*printf("time: ");
        for (int i = 1; i <= tot; i++) {
            printf("%d ", time[i]);
        }
        printf("\n");*/
        if (k == top) {
            return true;
        }
        for (int i = 1; i <= tot; i++) {
            // printf("%d %d %d %d\n", time[i], cnt[stk[k]], w, mx[i]);
            if (time[i] + cnt[stk[k]] <= w && cnt[stk[k]] <= mx[i]) {
                time[i] += cnt[stk[k]];
                /*printf("-> time: ");
                for (int i = 1; i <= tot; i++) {
                    printf("%d ", time[i]);
                }
                printf("\n");*/
                bool ret = self(self, k + 1, tot);
                time[i] -= cnt[stk[k]];
                if (ret) {
                    return ret;
                }
            }
        }
        return false;
    };
    auto dfs = [&](auto &&self, int cur, int k, int tot) -> bool {
        if (k == 0) {
            top = 0;
            // printf("---begin---\n");
            for (int i = 1; i <= kind; i++) {
                // printf("time[%d] = %d\n", i, time[i]);
                if (!used[i]) {
                    stk[top++] = i;
                }
            }
            /*printf("stk: ");
            for (int i = 0; i < top; i++) {
                printf("%d ", cnt[stk[i]]);
            }
            printf("\n\n\n");*/
            return dfs2(dfs2, 0, tot);
        }
        for (int i = cur + 1; i <= kind - k + 1; i++) {
            used[i] = true;
            time[tot - k + 1] += cnt[i];
            mx[tot - k + 1] = cnt[i];
            bool ret = self(self, i, k - 1, tot);
            used[i] = false;
            time[tot - k + 1] -= cnt[i];
            if (ret) {
                return ret;
            }
        }
        return false;
    };
    used[1] = true;
    time[1] = cnt[1];
    mx[1] = cnt[1];
    for (int k = 1; k <= kind; k++) {
        if (dfs(dfs, 1, k - 1, k)) {
            printf("%d", k);
            break;
        }
    }
    return 0;
}
/*
28 14
1 1 1 1 1 1 1
2 2 2 2 2 2 2
3 3 3
4 4 4
5 5 5
6 6 6 6 6
*/