4 2 12
10 16 22 28
 10 3 1
5 5 5 6 6 7 8 8 8 9
 8 7 13
52 85 14 52 92 33 80 85
 10 5 293149357
79072863 760382815 358896034 663269192 233367425 32795628 837363300 46932461 179556769 763342555
 10 3 0
1 1 2 2 2 2 2 2 2 2
 10 4 28
5 5 6 6 30 30 32 33 50 55
 6 2 1
1 1 2 3 4 5
 6 3 3
1 1 1 1 1 5
 4 2 1
1 1 2 3
 6 3 2
1 2 3 3 4 5
 5 2 3
8 9 11 12 16
 10 3 3
1 1 2 4 5 6 9 10 11 12
 6 3 3
2 2 2 4 7 7
 3 2 257816048
1 999999999 999999999
 6 3 2
1 2 2 3 4 5
 9 3 2
1 2 2 3 4 5 6 7 7
 4 2 100
1 2 3 200
 7 3 3
6 8 9 10 12 13 14
 10 3 3
1 2 3 3 3 3 3 3 3 5
 10 4 9
47 53 33 48 35 51 18 47 33 11
 13 2 86
841 525 918 536 874 186 708 553 770 268 138 529 183
 7 3 3
1 2 4 6 7 8 10
 10 3 3
1 1 1 2 2 5 6 7 8 9
 6 2 2
1 2 3 4 6 7
 9 3 3
1 2 3 4 5 6 7 8 9
 18 2 86
665 408 664 778 309 299 138 622 229 842 498 389 140 976 456 265 963 777
 10 4 1
2 2 2 3 3 10 10 10 11 11
 3 2 76
44 5 93
 6 3 3
1 2 3 4 5 6
 8 4 5
1 1 1 1 1 9 9 9
 12 3 2
1 2 3 9 10 11 12 13 14 15 15 15
 8 3 6
1 2 3 3 4 7 11 11
 6 3 3
1 2 3 4 7 8
 10 4 15
20 16 6 16 13 11 13 1 12 16
 4 2 3
1 2 3 6
 7 3 3
1 1 3 4 4 4 7
 6 3 3
1 1 4 3 3 6
 6 3 4
1 2 3 4 6 7
 8 2 3
1 2 3 4 10 11 12 13
 6 2 2
2 3 4 5 6 8
 8 3 3
1 1 1 2 2 3 3 5
 18 3 1
1 1 1 2 2 3 5 5 5 6 6 7 9 9 9 10 10 11
 1 1 1
1
 16 2 2
3 3 3 4 5 6 7 9 33 33 33 32 31 30 29 27
 4 2 4
9 1 2 3
 3 2 2
6 7 7
 5 2 7
1 3 4 5 10
 5 2 9
3 8 9 14 20
 3 2 15
1 18 19
 5 2 3
1 2 3 4 100
 14 2 75
105 300 444 610 238 62 767 462 17 728 371 578 179 166
 7 3 3
1 2 3 4 4 5 5
 10 4 7
4 3 6 5 4 3 1 8 10 5
 6 3 4
1 1 3 5 8 10
 7 2 2
1 2 3 4 5 6 7
 15 8 57
40 36 10 6 17 84 57 9 55 37 63 75 48 70 53
 11 3 4
1 1 1 5 5 5 10 12 14 16 18
 8 3 6
1 2 3 3 7 4 11 11
 6 4 0
1 3 2 4 2 1
 5 2 3
5 7 7 7 10
 9 3 1
1 2 2 2 2 3 4 4 5
 11 3 1
1 1 2 2 3 3 3 4 4 5 5

YES
 YES
 NO
 NO
 NO
 YES
 YES
 NO
 YES
 YES
 NO
 YES
 YES
 NO
 YES
 YES
 NO
 NO
 YES
 NO
 YES
 NO
 YES
 YES
 YES
 YES
 YES
 NO
 YES
 NO
 YES
 YES
 NO
 YES
 YES
 YES
 YES
 YES
 YES
 YES
 YES
 YES
 YES
 YES
 NO
 YES
 YES
 YES
 NO
 NO
 YES
 YES
 YES
 NO
 YES
 NO
 NO
 YES
 NO
 YES
 YES
 YES

import java.util.*;
import java.io.*;
import java.lang.*;
import java.math.*;
public class E {
  public static boolean[] seg; // size 4N+1
  public static boolean[] values; // size N
  public static boolean DEFAULT_VALUE = false;
  public static boolean combine(boolean a, boolean b) {
    return a || b;
  }
  public static void build(int node, int i, int j) {
    if(i == j)
      seg[node] = values[i];
    else {
      build(2*node, i, (i+j)/2);
      build(2*node+1, (i+j)/2+1, j);
      seg[node] = combine(seg[2*node], seg[2*node+1]);
    }
  }
  // update combines value with every element in [b, e]
  // if you want to set value instead of combine, replace lines with seg[node] = lazy[node], lazy[2*node] = lazy[node], etc. (in update and query)
  public static void update(int node, int i, int j, int index, boolean value) {
      if(index < i || index > j || i > j) return;
      if(i == j) {
          seg[node] |= value; // if [i,j] is contained in our interval, how does operation on node change?
          return;
      }
      update(2*node, i, (i+j)/2, index, value);
      update(2*node+1, (i+j)/2+1, j, index, value);
      seg[node] = combine(seg[2*node], seg[2*node+1]);
  }

  public static boolean query(int node, int i, int j, int b, int e) {
      if(e < i || b > j || i > j) return DEFAULT_VALUE; // DEFAULT VALUE
      if(i >= b && j <= e) return seg[node];
      boolean first = query(2*node, i, (i+j)/2, b, e);
      boolean second = query(2*node+1, (i+j)/2+1, j, b, e);
      return combine(first, second);
  }

    public static void main(String[] args) throws Exception {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        // Scanner scan = new Scanner(System.in);
        PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
        // int n = Integer.parseInt(bf.readLine());
        StringTokenizer st = new StringTokenizer(bf.readLine());
        int n = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());
        int d = Integer.parseInt(st.nextToken());
        st = new StringTokenizer(bf.readLine());
        Integer[] aa = new Integer[n]; for(int i=0; i<n; i++) aa[i] = Integer.parseInt(st.nextToken());
        Arrays.sort(aa);
        int[] a = new int[n];
        for(int i=0; i<n; i++) a[i] = aa[i];


        int[] begin = new int[n];
        int[] end = new int[n];

        for(int i=0; i<n; i++) {
          begin[i] = (i+k-1)+1;
          int low = 0;
          int high = n-1;
          while(low < high) {
            int mid = (low+high+1)/2;
            if(a[mid] > a[i]+d) high=mid-1;
            else low=mid;
          }
          end[i] = low+1;
        }
        values = new boolean[n+1];
        values[n] = true;
        seg = new boolean[4*(n+1)+1];
        build(1, 0, n);

        for(int i=n-1; i>=0; i--) {
          if(begin[i] <= end[i]) {
            boolean next_val = query(1, 0, n, begin[i], end[i]);
            update(1, 0, n, i, next_val);
          }
        }

        boolean ans = query(1, 0, n, 0, 0);
        if(ans) out.println("YES");
        else out.println("NO");


        // int n = scan.nextInt();

        out.close(); System.exit(0);
    }
}
