/*
TASK:excess
LANG:C++
*/
#include<iostream>
using namespace std;
int main()
{
    long n,k,i,kl[100000],br=0,a[100000],j,bri=0;
    cin>>n>>k;
    for(i=1;i<=n;i++){
    cin>>a[i];
    kl[i]=0;
                      }
    for(i=1;i<=(n-k)+1;i++){
                      br=0;
                      j=i;
                      if(kl[i]==0){
                      do{ 
                           j++;
                          if(a[j]==a[i]) {br++;kl[j]=1;}
                          }
                      while(br!=k && j!=n);
                      if(br<k-1) bri++;}
                      }
    cout<<bri<<endl;
}
