using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var a = NList;
        var INF = long.MinValue;
        var dp = new long[m + 1][];
        for (var i = 0; i < dp.Length; ++i) dp[i] = Enumerable.Repeat(INF, n + 1).ToArray();
        dp[0][0] = 0;
        for (var i = 0; i < dp.Length; ++i)
        {
            if (i == 0)
            {
                for (var j = 0; j < n; ++j) dp[i][j + 1] = dp[i][j] + a[j];
            }
            else
            {
                for (var j = 0; j < n; ++j)
                {
                    if (i % 2 == 0) dp[i][j + 1] = Math.Max(dp[i][j + 1], Math.Max(dp[i - 1][j], dp[i][j]) + a[j]);
                    else dp[i][j + 1] = Math.Max(dp[i][j + 1], Math.Max(dp[i - 1][j], dp[i][j]) - a[j]);
                }
            }
        }
        var ans = new List<int>();
        var line = 0;
        var mpos = 0L;
        for (var i = 0; i <= m; ++i) if (mpos < dp[i][n])
        {
            line = i;
            mpos = dp[i][n];
        }
        for (var j = n - 1; j >= 0; --j)
        {
            if (line % 2 == 0)
            {
                if (line > 0 && dp[line - 1][j] + a[j] == dp[line][j + 1])
                {
                    --line;
                    ans.Add(j);
                }
            }
            else
            {
                if (dp[line - 1][j] - a[j] == dp[line][j + 1])
                {
                    --line;
                    ans.Add(j);
                }
            }
        }
        ans.Reverse();
        while (ans.Count < m) ans.Add(n);
        WriteLine(string.Join("\n", ans));
    }
}