Skokovi

In a land who knows where, in a world who knows when, lives a bee named Maya. Her adventure-filled life is an endless source of ideas for tasks, so we chose one of them. Maya's friend, a grasshopper named Filip, is preparing for the Olympics in flower jumping. The meadow has $N$ flowers in a row, and flower $i$ has height $a_i$, a positive integer. Filip always jumps from left to right. From flower $i$, he can jump to flower $j$ if and only if $i < j$ and $|a_i - a_j| \le K$, where $K$ is a given positive integer. Starting from the leftmost flower, determine which flowers Filip can reach.

The first line contains positive integers $N$ ($1 \le N \le 2 \cdot 10^5$) and $K$ ($1 \le K \le 10^9$). The second line contains $N$ positive integers $a_1, \dots, a_N$ ($1 \le a_i \le 10^9$), the heights of the flowers.

Print $N$ numbers, each either $0$ or $1$, on a single line. The $i$-th number is $1$ if flower $i$ is reachable and $0$ otherwise. The first flower is always reachable, since Filip starts there.