#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,c,k,t[N];
int main()
{
	scanf("%d%d%d",&n,&c,&k);
	for (int i=1;i<=n;i++) scanf("%d",&t[i]);
	sort(t+1,t+n+1);
	int ans=0;
	for (int i=1;i<=n;){
		int last=i;
		while (t[last]+k>=t[i]&&i<last+c&&i<=n) i++;
		ans++;
	}
	printf("%d\n",ans);
	return 0;
}