A night procession winds through town carrying n paper lanterns in a single file, numbered 0 to n-1 from front to back. Each lantern has a brightness value. Local superstition says a lantern is "glow-shielded" if the lantern immediately in front of it (the lantern with the previous index) burns brighter than a given glare threshold g. The very first lantern in the line has nothing in front of it, so it is never glow-shielded. Given every lantern's brightness and the threshold, find every glow-shielded lantern.

Input format

• Line 1: two integers n and g.
• Line 2: n integers, the brightness values of the lanterns in order, brightness[0] through brightness[n-1].

Output format

Print the 0-indexed positions of every glow-shielded lantern, in increasing order, separated by single spaces on one line. If no lantern is glow-shielded, print an empty line.

Constraints

• 1 <= n <= 10^5
• 0 <= g <= 10^9
• 0 <= brightness[i] <= 10^9

5 10
20 5 15 8 30

1 3

4 100
5 5 5 5

(empty)