#include<iostream>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<algorithm>
#include<cmath>
#include<cstdio>
#include<iomanip>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main()
{
	int n, w;
	cin >> n >> w;
	vector<int>a(13 + 1);
	for (int i = 1; i <= n; i++)
	{
		int temp;
		cin >> temp;
		a[temp]++;
	}
	auto cmp = [&](int a, int b)
		{
			return a > b;
		};
	vector<bool>is(13 + 1);
	sort(a.begin() + 1, a.begin() + 1 + 13,cmp);
	int maxnn = 1 << 13;
	int ans = 0;
	while (1)
	{
		bool iis = 1;
		for (int i = 1; i <= 13; i++)
		{
			if (is[i] == 0&&a[i]!=0)
			{
				iis = 0;
				break;
			}
		}
		if (iis) break;
		vector<int>dp(w + 1);
		int maxn = 0;
		int pos = 0;
		for (int i = 1; i <= 13; i++)
		{
			if (!is[i] && a[i])
			{
				pos = i;
				break;
			}
		}
		vector<int>num;
		for (int i = 1; i <= maxnn - 1; i++)
		{
			int temp = 0;
			bool ok = 1;
			if ((1 << (pos - 1)) & i)
			{
				for (int j = 0; j < 13; j++)
				{
					if ((1 << j) & i&&(a[j+1]==0||is[j+1]))
					{
						ok = 0;
						break;
					}
				}
				if (ok == 0) continue;
				for (int j = 0; j < 13; j++)
				{
					if ((1 << j) & i)
					{
						temp += a[j+1];
					}
				}
				if (maxn < temp&&temp<=w)
				{
					maxn = temp;
					num.clear();
					for (int j = 0; j < 13; j++)
					{
						if ((1 << j) & i)
						{
							num.push_back(j+1);
						}
					}
				}
			}
		}
		for (auto j : num)
		{
			is[j] = 1;
		}
		num.clear();
		ans++;
	}
	cout << ans << '\n';
	return 0;
}