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

dp=[[-10**19]*(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):
    for j in range(m+1):
        dp[i+1][j]=max(dp[i+1][j],dp[i][j]+val(a[i+1],j))
        if j<m:
            dp[i+1][j+1]=max(dp[i+1][j+1],dp[i][j]+val(a[i+1],j+1))

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

ans=[]
for i in reversed(range(n-1)):
    if dp[i+1][idx]!=dp[i][idx]+val(a[i+1],idx):
        idx-=1
        ans.append(i+1)
if idx>0:
    ans.append(1)
for i in reversed(ans):
    print(i)
for i in range(m-len(ans)):
    print(n)