/*
TASK:EXCESS
LANG:C++
*/
#include<iostream>
using namespace std;
long long a[100000];
int main()
{
    int max,br=0,n,k,i;
    long long b;
    cin>>n>>k;
    cin>>b;max=b;a[b]++;
    for(i=1;i<n;i++)
    {
    cin>>b;
    a[b]++;
    if(b>max)max=b;
    }
    for(i=0;i<=max;i++)
    if(a[i]<k&&a[i]!=0)br++;
    cout<<br<<endl;
    return 0;
}
