#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e18;
const int INF = 0x3f3f3f3f;
int a[200010];
int dp[1000010];
int main() {
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    dp[a[i]] = 1;
  }
  int t = 0, p = 0;
  int res = 0;
  for (int i = 1; i <= 1e6; i++) {
    t += dp[i];
    if (i > m) t -= dp[i - m];
    if (t == k) {
      dp[i] = 0;
      res++;
      t--;
    }
  }
  cout << res << endl;
}
