from bisect import bisect_left, bisect_right
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = sorted(a)
l = -1; r = 10**9+10
while (r-l > 1):
    x = (r+l)//2
    t = bisect_right(b, x)
    if t > k: r = x
    else: l = x

s = ''.join(['o' if x > l else 'x' for x in a])
ans = [i+2 for i in range(n-1) if s[i:i+2] == 'xo']
print(len(ans))
print(*ans)