import bisect
n,k=map(int,input().split())
A=list(map(int,input().split()))
As=sorted(A)
l,r=0,10**9
while r-l>1:
    c=(r+l)//2
    if bisect.bisect_right(As,c)>=k:
        r=c
    else:
        l=c
ans=[i>r for i in A]
Ans=[]
for i in range(n-1):
    if not ans[i] and ans[i+1]:
        Ans.append(i+2)
print(len(Ans))
print(*Ans)