/*
TASK:excess
LANG:C++
*/
#include<iostream>
#include<vector>
using namespace std;
long a,b,c,d,e,f,n,i,j,k,bri,br,pbr;
vector<long> z;
int main()
{
    cin>>n>>k;
    for(i=1; i<=n; i++)
    {
             cin>>a;
             z.push_back(a);
    }
    sort(z.begin(),z.end());
    for(i=0; i<=n-1; i++)
    {
             if(z[i]==pbr) {br++;}
             else {pbr=z[i]; if(br<k) {bri++;} br=1;}
    }
    cout<<bri<<endl;
    return 0;
}
