Problem Statement

There are $N$ people on a number line. The people are numbered $1$ to $N$, and person $i$ is at coordinate $X_i$. Multiple people may be at the same coordinate.

A person is said to "stand apart" if their distance to every other person is at least $D$.

Formally, person $i$ is said to "stand apart" if $|X_i-X_j| \geq D$ holds for all $j ~ (1 \leq j \leq N,\ j \neq i)$.

Output the numbers of all people who "stand apart" in ascending order.

Constraints

• $2 \le N \le 100$
• $1 \le D \le 10^9$
• $1 \le X_i \le 10^9$
• All input values are integers.

Input

The input is given from Standard Input in the following format:

• $N$ $D$
• $X_1$ $X_2$ $\ldots$ $X_N$

Output

Let $K$ be the number of people who stand apart, and let $(P_1,P_2,\dots,P_K)$ be the sequence of their numbers sorted in ascending order. Output them in the following format:

• $K$
• $P_1$ $P_2$ $\ldots$ $P_K$

If $K=0$, the second line should be empty.

3 3
1 5 7

1
1

• Person $1$ has distance $4$ to person $2$ and distance $6$ to person $3$, so their distance to every other person is at least $D$. Thus, person $1$ "stands apart".
• Person $2$ has distance $2$ to person $3$, so person $2$ does not "stand apart".
• Similarly, person $3$ has distance $2$ to person $2$, so person $3$ does not "stand apart" either.
• Thus, only person $1$ "stands apart".

3 2
1 1 1

0

• There may be people at the same coordinate. Also, if no one "stands apart", the second line should be empty.

8 3
4 77 20 26 9 26 22 40

4
1 2 5 8

• Output the numbers of the people who "stand apart" in ascending order.

• Source: AtCoder ABC 477 B