#include<iostream>
		#include<queue>
		#include<map>
		#include<set>
		#include<vector>
		#include<algorithm>
		#include<deque>
		#include<cctype>
		#include<string.h>
		#include<math.h>
		#include<time.h>
		#include<random>
		#include<stack>
		#include<string>
		#define ll                        long long 
		#define lowbit(x) (x & -x)
		#define endl "\n"
		using namespace std;
		mt19937 rnd(time(0));
		const ll mod=1e9+7;
		ll ksm(ll x,ll y)
		{
			ll ans=1;
			while(y)
			{
				if(y&1)
				{
					ans=ans%mod*(x%mod)%mod;
				}
				x=x%mod*(x%mod)%mod;
				y>>=1;
			}
			return ans;
		}
		ll gcd(ll x, ll y)
		{
			if (y == 0)
				return x;
			else
				return gcd(y, x % y);
		}
		void fio()
		{
			ios::sync_with_stdio(0);
			cin.tie(0);
			cout.tie(0);
		}
		bool cmp(ll x,ll y){
			return x>y;
		}
		ll a[550000];
		ll b[550000];
		ll dp[550000];
		ll wz[550000];	
		set<ll>q[50005];
		int main()
		{
			fio();
			ll n,m;
			set<ll>f;
			cin>>n>>m;
			for(ll i=1;i<=14;i++)wz[i]=0;
			for(ll i=1;i<=n;i++)cin>>a[i],wz[a[i]]++,f.insert(a[i]);
			ll cnt=0;
			for(auto j:f)
			{
				cnt++;
				b[cnt]=wz[j];
			}
			sort(b+1,b+1+cnt,cmp);
			ll ans=0;
				for(ll i=1;i<=cnt;i++)
				{
					    if(b[i]==0)continue;
						else 
						{

							ans++;
						for(ll i=0;i<=m;i++)q[i].clear(),dp[i]=0;
						for(ll k=i+1;k<=cnt;k++)
						{

						for(ll j=m-b[i];j>=b[k];j--)
					    {
						if(dp[j]<dp[j-b[k]]+b[k])
						{
							dp[j]=dp[j-b[k]]+b[k];
							q[j].clear();
							q[j].insert(q[j-b[k]].begin(),q[j-b[k]].end());
							q[j].insert(k);
						}
					    }
						}
						//cout<<dp[m-b[i]]<<endl;
						for(auto j:q[m-b[i]])
						{
							b[j]=0;
						}
						b[i]=0;
						}
				}	
			cout<<ans<<endl;
		}