#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define FOE(i, s, t) for (int i = s; i <= t; i++)
int n, c, k;
int last, cnt;
int ret = 1;
#define K 600001
int a[K];
int main(){
scanf("%d%d%d", &n, &c, &k);
FOE(i, 1, n) scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
last = a[1];
cnt = 1;
FOE(i, 2, n){
if (cnt == c || last + k < a[i]){
ret++;
cnt = 0;
last = a[i];
}
cnt++;
}
printf("%d\n", ret);
}