#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long dp[2020][2020][2] = {}, a[2020];
bool dp1[2020][2020][2];
int main() {
	int n, m;
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	reverse(a + 1, a + n + 1);
	dp[0][0][0] = 0, dp[0][0][1] = 0;
	for (int i = 1; i <= n; i++) {
		for (int j = m; j > 0; j--) {
			if (-a[i] + -dp[i - 1][j - 1][0] > a[i] + dp[i - 1][j][1]) {
				dp[i][j][1] = -a[i] + -dp[i - 1][j - 1][0];
				dp1[i][j][1] = 1;
			}
			else {
				dp[i][j][1] = a[i] + dp[i - 1][j][1];
				dp1[i][j][1] = 0;
			}
			if (-a[i] + -dp[i - 1][j - 1][1] < a[i] + dp[i - 1][j][0]) {
				dp[i][j][0] = -a[i] + -dp[i - 1][j - 1][1];
				dp1[i][j][0] = 1;
			}
			else {
				dp[i][j][0] = a[i] + dp[i - 1][j][0];
				dp1[i][j][0] = 0;
			}
		}
		dp[i][0][0] = a[i] + dp[i - 1][0][0];
		dp[i][0][1] = a[i] + dp[i - 1][0][1];
	}
	long long ans = -10000000000000007;
	int n1 = n, m1, k1 = 1;
	for (int i = 0; i <= m; i++) {
		ans = max(ans, dp[n][i][1]);
		m1 = i;
	}
	vector<int> ans1;
	while (n1 > 0) {
		if (dp1[n1][m1][k1]) {
			m1--;
			k1 = !k1;
			ans1.emplace_back(n - n1);
		}
		n1--;
	}
	for (int i = 0; i < ans1.size(); i++) {
		cout << ans1[i] << endl;
	}
	for (int i = 0; i < m - ans1.size(); i++) {
		cout << n << endl;
	}
}