#include <bits/stdc++.h>
using namespace std;
 
const int maxn = 110000;
int n;
int A, B;
int a[maxn];
map<int, int> belong;
map<int, bool> flag;
 
int main() {
  int fail = 0;
  scanf("%d%d%d", &n, &A, &B);
  for(int i = 1; i <= n; i ++) {
    scanf("%d", &a[i]);
    flag[a[i]] = 1;
  }
  sort(a + 1, a + 1 + n);
  if(A == B) {
    for(int i = 1; i <= n; i ++) {
      if(flag[B - a[i]] == 0) {
        fail = 1;
        break;
      }
      belong[a[i]] = 2;
    }
  } else {
    while(1) {
      if(fail) break;
      int ss = 0;
      for(int i = 1; i <= n; i ++) {
        if(belong[a[i]]) continue;
        if(flag[A - a[i]] == 0 && flag[B - a[i]] == 0) {
          fail = 1;
          break;
        } else if(flag[A - a[i]] == 1 && (flag[B - a[i]] == 0 || belong[B - a[i]])) {
          if(belong[A - a[i]] == 2) {
            fail = 1;
            break;
          }
          belong[a[i]] = 1;
          belong[A - a[i]] = 1;
          ss = 1;
        } else if((flag[A - a[i]] == 0 || belong[A - a[i]]) && flag[B - a[i]] == 1) {
          if(belong[B - a[i]] == 1) {
            fail = 1;
            break;
          }
          belong[a[i]] = 2;
          belong[B - a[i]] = 2;
          ss = 1;
        } else {
          if(A - a[i] != a[i] && B - a[i] != a[i]) {
            if(belong[A - a[i]] == 0 && belong[B - a[i]] == 0) {
              continue;
            } else if(belong[A - a[i]]) {
              belong[a[i]] = belong[A - a[i]];
              ss = 1;
            } else {
              belong[a[i]] = belong[B - a[i]];
              ss = 1;
            }
          } else if(A - a[i] == a[i]) {
            if(belong[B - a[i]] == 1) {
              fail = 1;
              break;
            }
            belong[a[i]] = 2;
            belong[B - a[i]] = 2;
            ss = 1;
          } else {
            if(belong[A - a[i]] == 2) {
              fail = 1;
              break;
            }
            belong[a[i]] = 1;
            belong[A - a[i]] = 1;
            ss = 1;
          }
        }
      }
      if(fail) break;
      if(ss == 0) break;
    }
  }
   
  if(fail == 0) {
    for(int i = 1; i <= n; i ++) {
      if(belong[a[i]] == 1 && belong[A - a[i]] != 1) fail = 1;
      if(belong[a[i]] == 2 && belong[B - a[i]] != 2) fail = 1;
    }
  }
   
  if(fail) {
    printf("NO\n");
  } else {
    printf("YES\n");
    for(int i = 1; i <= n; i ++) {
      printf("%d", belong[a[i]] - 1);
      if(i < n) printf(" ");
      else printf("\n");
    }
  }
   
  return 0;
}