// yukicoder: 1536 仕切り直し
// 2021.8.14

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

typedef long long ll;

#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)

int in() {
	int n = 0; int c = gc();
	if (c == '-') {
		c = gc();
		do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
		return -n;
	}
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

void out(int n) {
	int i; char b[30];
	if (!n) pc('0');
	else {
//		if (n < 0) pc('-'), n = -n;
		i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;
		while (i--) pc(b[i]);
	}
	pc('\n');
}

typedef struct { ll v; int id, l, r; } T;
T a[2005], _a[2005]; int sz;
char sg[2005];
int A[2005]; int N;
int ans[2005];

int cmp(const void *a, const void *b) {
	if (((T *)a)->v < ((T *)b)->v) return -1;
	if (((T *)a)->v > ((T *)b)->v) return 1;
	return ((T *)b)->r - ((T *)a)->r;
}

int main() {
	int i, j, M;
	ll s;

	N = in(), M = in();
	for (i = 0; i < N; ++i) A[i] = in();
	i = 0; while (i < N) {
		if (A[i] >= 0) {
			s = 0; a[sz].l = i;
			while (i < N && A[i] >= 0) s += A[i++];
			a[sz].v = s, a[sz].r = i, a[sz].id = sz, sz++;
		} else {
			s = 0; a[sz].l = i;
			while (i < N && A[i] <= 0) s += A[i++];
			a[sz].v = s, a[sz].r = i, a[sz].id = sz, sz++;
		}
	}

	memcpy(_a, a, sizeof(a));
	qsort(a, sz, sizeof(T), cmp);

	j = 0;
	for (i = 0; j < M && i < sz; ++i) {
		if (a[i].v >= 0) break;
		if (j+2 <= M) {
			ans[j++] = a[i].l, ans[j++] = a[i].r;
			sg[a[i].id] = 1;
		} else {
			int pos = sz; ll ma = 1e15;
			s = 0;
			for (int i = sz-1; i >= 0; i--) {
				if (sg[i]) s -= _a[i].v;
				else       s += _a[i].v;
				if (s < ma) ma = s, pos = i;
			}
			if (ma < 0) ans[j++] = _a[pos].l;
			break;
		}
	}
	while (j < M) ans[j++] = N;
	for (i = 0; i < M; ++i) out(ans[i]);
	return 0;
}