#include <bits/stdc++.h>
using namespace std;
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
  os << "(";
  os << v.first << "," << v.second << ")";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "[";
  long long sz = v.size();
  for (long long i = 0; i < sz; ++i) {
    os << v[i];
    if (i != sz - 1) os << ",";
  }
  os << "]\n";
  return os;
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
  T last = *v.rbegin();
  os << "[";
  for (auto it : v) {
    os << it;
    if (it != last) os << ",";
  }
  os << "]\n";
  return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
  for (auto it : v) {
    os << it.first << " : " << it.second << "\n";
  }
  return os;
}
long long power(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b % 2) {
      res = (res * a) % 1000000007;
    }
    b /= 2;
    a = (a * a) % 1000000007;
  }
  return res;
}
template <typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
  const char *comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
const long long N = 5e5 + 1;
long long arr[N];
long long dp[N];
long long tree[N * 4];
void update(long long i, long long l, long long r, long long j) {
  if (l == r) {
    tree[i] += 1;
    return;
  }
  long long m = (l + r) >> 1;
  if (j <= m)
    update(i + i, l, m, j);
  else
    update(i + i + 1, m + 1, r, j);
  tree[i] = tree[i + i] + tree[i + i + 1];
}
long long query(long long i, long long l, long long r, long long s,
                long long e) {
  if (l >= s && r <= e) {
    return tree[i];
  }
  if (r < s || l > e || l > r) return 0;
  long long m = (l + r) >> 1;
  return query(i + i, l, m, s, e) + query(i + i + 1, m + 1, r, s, e);
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, k, d;
  cin >> n >> k >> d;
  for (long long i = 1; i <= n; ++i) cin >> arr[i];
  sort(arr + 1, arr + n + 1);
  dp[0] = 1;
  update(1, 0, N - 1, 0);
  for (long long i = 1; i <= n; ++i) {
    long long low = 1, high = i, mid, res = -1;
    while (low <= high) {
      mid = (low + high) >> 1;
      if (arr[i] - arr[mid] <= d) {
        res = mid;
        high = mid - 1;
      } else
        low = mid + 1;
    }
    if (res == -1) continue;
    long long temp = query(1, 0, N - 1, res - 1, i - k);
    dp[i] = temp > 0;
    if (dp[i]) update(1, 0, N - 1, i);
  }
  if (dp[n])
    cout << "YES\n";
  else
    cout << "NO\n";
  return 0;
}
