INF = 1 << 60

n, m = map(int, input().split())
a = [0] + list(map(int, input().split()))

dpmin = [[INF for _ in range(m + 1)] for _ in range(n + 1)]
dpmax = [[- INF for _ in range(m + 1)] for _ in range(n + 1)]
dpmin[-1][0] = a[-1]
dpmax[-1][0] = a[-1]
for i in range(n, 0, -1):
  for j in range(m + 1):
    if j < m:
      dpmin[i - 1][j + 1] = min(dpmin[i - 1][j + 1], - dpmax[i][j] + a[i - 1])
      dpmax[i - 1][j + 1] = max(dpmax[i - 1][j + 1], - dpmin[i][j] + a[i - 1])
    dpmin[i - 1][j] = min(dpmin[i - 1][j], dpmin[i][j] + a[i - 1])
    dpmax[i - 1][j] = max(dpmax[i - 1][j], dpmax[i][j] + a[i - 1])

rest = 0
for j in range(m + 1):
  if dpmax[0][rest] < dpmax[0][j]:
    rest = j

ans = []
flg = False
for i in range(n):
  if rest <= 0:
    break

  if flg:
    if dpmin[i][rest] != dpmin[i + 1][rest] + a[i]:
      ans.append(i)
      flg = False
      rest -= 1
  else:
    if dpmax[i][rest] != dpmax[i + 1][rest] + a[i]:
      ans.append(i)
      flg = True
      rest -= 1

while len(ans) < m:
  ans.append(n)

print(*ans, sep="\n")