#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T1, class T2>
inline void print(T1 x1, T2 x2) {
  printsp(x1), println(x2);
}
template <class T1, class T2, class T3>
inline void print(T1 x1, T2 x2, T3 x3) {
  printsp(x1), printsp(x2), println(x3);
}
template <class T1, class T2, class T3, class T4>
inline void print(T1 x1, T2 x2, T3 x3, T4 x4) {
  printsp(x1), printsp(x2), printsp(x3), println(x4);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
int a[500011], nxt[500011];
int pre[500011];
int dp[500011];
int sum[500011];
int main() {
  int n, k, d;
  cin >> n >> k >> d;
  for (int i = 1; i <= n; i++) gn(a[i]);
  sort(a + 1, a + n + 1);
  int pos = 1;
  for (int i = 1; i <= n; i++) {
    while (pos <= n and a[pos] - a[i] <= d) pos++;
    nxt[i] = pos - 1;
  }
  dp[n + 1] = sum[n + 1] = 1;
  for (int i = n; i >= 1; i--) {
    if (nxt[i] - i + 1 < k) {
      dp[i] = 0;
    } else {
      if (sum[i + k] - sum[nxt[i] + 2])
        dp[i] = 1;
      else
        dp[i] = 0;
    }
    sum[i] = sum[i + 1] + dp[i];
  }
  if (dp[1])
    puts("YES");
  else
    puts("NO");
  return 0;
}
