/*
 * Solution Template for Pairing Cards
 * 
 * Australian Informatics Olympiad 2025
 * 
 * This file is provided to assist with reading of input and writing of output
 * for the problem. You may modify this file however you wish, or
 * you may choose not to use this file at all.
 */

#include <cstdio>

/* N is the number of cards. */
int N;
/* D and S are the allowed difference and sum of paired cards. */
int D;
int S;

/*
 * A contains the values on the cards. Note that the array starts from 0, and
 * so the values are A[0] to A[N-1].
 */
int A[200005];

int main(void) {
  /* Read the values of N, D, S, and the values on the cards. */
  scanf("%d%d%d", &N, &D, &S);
  for (int i = 0; i < N; i++) {
    scanf("%d", &A[i]);
  }

  /*
   * TODO: This is where you should compute your solution. You should output
   * YES or NO depending on whether it is possible to divide the cards into N/2
   * valid pairs. An example of how to output YES is shown below.
   */

  printf("YES\n");

  return 0;
}