#include <bits/stdc++.h>
using i64 = long long;
const int MAXN = 13;
void solve() {
    int n, w;
    std::cin >> n >> w;
    std::vector<int> tot(MAXN);
    for (int i = 0; i < n; ++i) {
        int x;
        std::cin >> x;
        tot[x - 1]++;
    }
    std::vector<int> dp(1 << MAXN, MAXN);
    dp[0] = 0;
    for(int i = 0; i < (1 << MAXN); ++i) {
        int sum = 0;
        for(int j = 0; j < MAXN; ++j) {
            if(i >> j & 1) {
                sum += tot[j];
            }
        }
        if(sum <= w) {
            dp[i] = 1;
        }
    }
    for(int i = 0; i < (1 << MAXN); ++i) {
        for(int j = i; j > 0; j = (j - 1) & i) {
            dp[i] = std::min(dp[i], dp[j] + dp[i ^ j]);
        }
    }
    std::cout << dp.back() << "\n";
}


int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int T = 1;
    while(T--) {
        solve();
    }
    return 0;
}