#include <queue>
#include <fstream>
using namespace std;
queue<long long> q;
long long cost,x,n,k,d;

int main ()
{ifstream f("zombie.in");
 ofstream g("zombie.out");
 f>>d>>n>>k;
 while(n)
 {f>>x;
 q.push(x);
 if(q.back()-q.front()>=d)
 if(q.size()-1>k)
 {cost+=k;
 while(q.size()!=1)
 q.pop();
 
 }
 else
 {q.pop();
 cost++;}

n--;}
n=q.size();
cost+=min(k,n);
g<<cost;
 f.close(); g.close();
return 0;
}