CF1417B.Two Arrays

RedDreamer has an array $a$ consisting of $n$ non-negative integers, and an unlucky integer $T$.

Let's denote the misfortune of array $b$ having length $m$ as $f(b)$ — the number of pairs of integers $(i, j)$ such that $1 \le i \lt j \le m$ and $b_i + b_j = T$. RedDreamer has to paint each element of $a$ into one of two colors, white and black (for each element, the color is chosen independently), and then create two arrays $c$ and $d$ so that all white elements belong to $c$, and all black elements belong to $d$ (it is possible that one of these two arrays becomes empty). RedDreamer wants to paint the elements in such a way that $f(c) + f(d)$ is minimum possible.

For example:

• if $n = 6$, $T = 7$ and $a = [1, 2, 3, 4, 5, 6]$, it is possible to paint the $1$-st, the $4$-th and the $5$-th elements white, and all other elements black. So $c = [1, 4, 5]$, $d = [2, 3, 6]$, and $f(c) + f(d) = 0 + 0 = 0$;
• if $n = 3$, $T = 6$ and $a = [3, 3, 3]$, it is possible to paint the $1$-st element white, and all other elements black. So $c = [3]$, $d = [3, 3]$, and $f(c) + f(d) = 0 + 1 = 1$.

Help RedDreamer to paint the array optimally!

RedDreamer 有一个由 $n$ 个非负整数组成的数组 $a$，以及一个不幸运的整数 $T$。

我们用 $f(b)$ 表示长度为 $m$ 的数组 $b$ 的“不幸值”——即满足 $1 \le i \lt j \le m$ 且 $b_i + b_j = T$ 的整数对 $(i, j)$ 的数量。RedDreamer 需要将数组 $a$ 中的每个元素独立地涂成两种颜色之一：白色或黑色；然后构造两个数组 $c$ 和 $d$，使得所有白色元素构成 $c$，所有黑色元素构成 $d$（允许 $c$ 或 $d$ 为空）。RedDreamer 希望以某种方式给元素上色，使得 $f(c) + f(d)$ 达到最小可能值。

例如：

• 若 $n = 6$，$T = 7$，且 $a = [1, 2, 3, 4, 5, 6]$，可将第 $1$、第 $4$ 和第 $5$ 个元素涂成白色，其余涂成黑色。于是 $c = [1, 4, 5]$，$d = [2, 3, 6]$，且 $f(c) + f(d) = 0 + 0 = 0$；
• 若 $n = 3$，$T = 6$，且 $a = [3, 3, 3]$，可将第 $1$ 个元素涂成白色，其余涂成黑色。于是 $c = [3]$，$d = [3, 3]$，且 $f(c) + f(d) = 0 + 1 = 1$。

请帮助 RedDreamer 实现最优涂色！

The first line contains one integer $t$ ($1 \le t \le 1000$) — the number of test cases. Then $t$ test cases follow.

The first line of each test case contains two integers $n$ and $T$ ($1 \le n \le 10^5$, $0 \le T \le 10^9$) — the number of elements in the array and the unlucky integer, respectively.

The second line contains $n$ integers $a_1$, $a_2$, ..., $a_n$ ($0 \le a_i \le 10^9$) — the elements of the array.

The sum of $n$ over all test cases does not exceed $10^5$.

第一行包含一个整数 $t$（$1 \le t \le 1000$）—— 测试用例的数量。接下来是 $t$ 个测试用例。

每个测试用例的第一行包含两个整数 $n$ 和 $T$（$1 \le n \le 10^5$，$0 \le T \le 10^9$）—— 分别表示数组的元素个数和“不幸运”整数。

每个测试用例的第二行包含 $n$ 个整数 $a_1$, $a_2$, ..., $a_n$（$0 \le a_i \le 10^9$）—— 数组的元素。

所有测试用例中 $n$ 的总和不超过 $10^5$。

For each test case print $n$ integers: $p_1$, $p_2$, ..., $p_n$ (each $p_i$ is either $0$ or $1$) denoting the colors. If $p_i$ is $0$, then $a_i$ is white and belongs to the array $c$, otherwise it is black and belongs to the array $d$.

If there are multiple answers that minimize the value of $f(c) + f(d)$, print any of them.

对于每个测试用例，输出 $n$ 个整数：$p_1$、$p_2$、…、$p_n$（每个 $p_i$ 为 $0$ 或 $1$），表示颜色。若 $p_i = 0$，则 $a_i$ 为白色，属于数组 $c$；否则 $a_i$ 为黑色，属于数组 $d$。

若存在多个使 $f(c) + f(d)$ 的值最小的解，输出其中任意一个即可。