n,k,*a=map(int,open(0).read().split())
def judge(x):
  s=sum(i<=x for i in a)
  return s>=k
ok,ng=10**9+1,0
while abs(ok-ng)>1:
  mid=ok+ng>>1
  if judge(mid):
    ok=mid
  else:
    ng=mid
ans=[]
for i in range(1,n):
  if a[i-1]<=ok<a[i]:
    ans+=i+1,
print(len(ans))
print(*ans)