Overshadowed Trees

Forester Linas takes care of a forest with $N$ trees. All the trees are planted on a single straight line, and the distance between any two adjacent trees is always 1 meter.

Linas dislikes that some trees are "overshadowed" by others, so he wants to fertilize the overshadowed trees to help them grow better. The $i$-th tree is overshadowed if the tallest other tree growing within a radius of $K$ meters around it is taller than its own height $h_i$ by at least $M$.

For example, consider $N = 6$, $K = 1$, $M = 2$ with tree heights $1, 2, 4, 3, 1, 1$ in order.

• Tree 5 is overshadowed. Within distance $K = 1$ there are two trees (tree 4 and tree 6). The difference between the taller tree 4's height ($3$) and tree 5's height ($1$) is $2$, which is at least $M = 2$.
• Tree 6 is not overshadowed. Within distance $K = 1$ there is only tree 5. The difference between their heights is $0$, which is not at least $M = 2$.

Find all overshadowed trees.

The first line contains three space-separated integers $N$, $K$, and $M$: the number of trees, the radius Linas inspects, and the height-difference threshold, respectively.

The second line contains $N$ space-separated integers $h_i$, the heights of the trees.

On the first line, print a single integer: the number of overshadowed trees in Linas's forest. On the second line, print the numbers of the overshadowed trees in increasing order (from the smallest to the largest), separated by spaces. If there are no overshadowed trees, print $0$ on the first line and leave the second line empty.

• $1 \le N, K, M, h_i \le 200000$ ($1 \le i \le N$)