J. Hide and Seek
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Gamal and Amr have just returned from school after a long day. They were bored, so they went to the park and decided to play a hide and seek game.

The park contains $$$n$$$ trees of different heights. The $$$i_{th}$$$ tree has height $$$h_{i}$$$. Amr will start hiding behind a tree, and Gamal will start looking for him.

Gamal will only catch Amr if Amr hid behind a tree that is strictly shorter than him.

You know Amr's height, which is equal to $$$x$$$, and the height of each tree in the park.

For every tree, your task is to determine if Amr will be caught if he hid behind it or not.

Input

The first line contains a single integer $$$t$$$ $$$(1 \leq t \leq 10^{3})- $$$the number of testcases.

The first line of a test case contains integers $$$n$$$ and $$$x$$$ $$$(1\leq n,x \leq 10^{5})- $$$the number of trees in the park and Amr's height, respectively.

The second line of a test case contains $$$n$$$ integers $$$h_{1},h_{2},...,h_{n}$$$ $$$(1\leq h_{i} \leq 10^{5})-$$$ the heights of the trees in the park.

It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$10^5$$$.

Output

For each test case, print $$$n$$$ integers $$$a_{1},a_{2},...,a_{n}$$$, where $$$a_{i}=1$$$ if Amr will be caught when he hid behind the $$$i_{th}$$$ tree, otherwise $$$a_{i}=0$$$.

Example
Input
3
5 3
1 3 1 10 2
3 2
1 1 1
2 2
2 2
Output
1 0 1 0 1 
1 1 1 
0 0