n,m=map(int,input().split())
a=list(map(int,input().split()))

dp=[[-10**18]*(m+1) for i in range(n)]
dp[0][0]=0

dp[0][0]=a[0]
dp[0][1]=-a[0]

def val(x,cnt):
    if cnt&1:
        return -x
    return x

for i in range(n-1):
    older=dp[i]
    newer=dp[i+1]
    for j in range(m+1):
        x=older[j]+(-a[i+1] if j&1 else a[i+1])
        if newer[j]<x:newer[j]=x
        if j<m:
            x=older[j]+(a[i+1] if j&1 else -a[i+1])
            if newer[j+1]<x:newer[j+1]=x

res=-10**18
idx=-1
last=dp[n-1]
for j in range(m+1):
    if res<last[j]:
        res=last[j]
        idx=j

cnt=0
for i in reversed(range(n-1)):
    if dp[i+1][idx]!=dp[i][idx]+(-a[i+1] if idx&1 else a[i+1]):
        idx-=1
        cnt+=1
        print(i+1)

if idx>0:
    print(1)
for i in range(m-cnt):
    print(n)