#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=100100;
int a[maxn];
int main(){
	int n,c,k;
	scanf("%d%d%d",&n,&c,&k);
	for(int i=1;i<=n;i++)
		scanf("%d",&a[i]);
	sort(a+1,a+n+1);
	int lef=0,t=0,ans=0;
	for(int i=1;i<=n;i++){
		if(lef==0||t<a[i]){
			ans++;
			lef=c;
			t=a[i]+k;
		}
		lef--;
	}
	printf("%d\n",ans);
	return 0;
}
