Little X has n distinct integers: p₁, p₂, ..., p_n. He wants to divide all of them into two sets A and B. The following two conditions must be satisfied:

If number x belongs to set A, then number a - x must also belong to set A.
If number x belongs to set B, then number b - x must also belong to set B.

Help Little X divide the numbers into two sets or determine that it's impossible.

Input

The first line contains three space-separated integers n, a, b (1 ≤ n ≤ 10⁵; 1 ≤ a, b ≤ 10⁹). The next line contains n space-separated distinct integers p₁, p₂, ..., p_n (1 ≤ p_i ≤ 10⁹).

Output

If there is a way to divide the numbers into two sets, then print "YES" in the first line. Then print n integers: b₁, b₂, ..., b_n (b_i equals either 0, or 1), describing the division. If b_i equals to 0, then p_i belongs to set A, otherwise it belongs to set B.

If it's impossible, print "NO" (without the quotes).

Note

It's OK if all the numbers are in the same set, and the other one is empty.

#	Name	Rating↕	Solved↕
1770D	Koxia and Game constructive algorithms data structures dfs and similar dsu flows games graph matchings graphs implementation	2000	4.5k
1027F	Session in BSU binary search dfs and similar dsu graph matchings graphs	2400	2k
468B	Two Sets 2-sat dfs and similar dsu graph matchings greedy	2000	5.5k

Problemset