#include <fstream>
#include <deque>
using namespace std;
deque <int> v;
int main()
{ int d,n,k,i,nr,sol=0,x;
    ifstream f("zombie.in");
    ofstream g("zombie.out");
    f>>d>>n>>k;
    f>>x;
    v.push_front(x);
    nr=1;
    for (i=2;i<=n;++i) {
        f>>x;
        if (x-v.front()<d) ++nr;
        else {
          sol+=min(nr,k);
          nr=1;
          while (!v.empty())
             v.pop_front();
        }
        v.push_back(x);
    }
      sol+=min(nr,k);
      g<<sol;
    return 0;
}