# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
from collections import defaultdict as dd
S = input
R = range
P = print
def I(): return int(S())
def M(): return map(int, S().split())
def L(): return list(M())
def O(): return list(map(int, open(0).read().split()))
def yn(b): print("Yes" if b else "No")
biga = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
smaa = "abcdefghijklmnopqrstuvwxyz"

n, k = M()
a = L()
b = sorted(a)[k - 1]
ans = []
for i in R(n - 1):
	if (a[i] <= b) and (a[i + 1] > b):
		ans.append(i + 2)
print(len(ans))
print(*ans)