#include <bits/stdc++.h>
using namespace std;
int main(){
long long int n,c,k,ans,temp,j,p,s;
scanf("%lld %lld %lld",&n,&c,&k);
long long int T[n];
for(int i=0;i<n;i++)
scanf("%lld",&T[i]);
sort(T,T+n);
ans = 0;
temp = 0;
while(temp<n){
j = 1;
s = temp;
p = T[temp];
temp++;
while(j<c && temp<n){
if(p+k>=T[temp]){
j++;
temp++;
p = T[temp];
}
else{
break;
}
}
ans++;
}
printf("%lld\n",ans);
return 0;
}