#include <cmath>
#include <deque>
#include <algorithm>
#include <iterator>
#include <list>
#include <tuple>
#include <map>
#include <unordered_map>
#include <queue>
#include <set>
#include <unordered_set>
#include <stack>
#include <string>
#include <vector>
#include <fstream>
#include <iostream>
#include <functional>
#include <numeric>
#include <iomanip> 
#include <stdio.h>
//eolibraries
#define lnf 3999999999999999999
#define inf 3999999999999999999
#define PI 3.14159265359
#define endl "\n"
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define ll long long
#define all(c) (c).begin(),(c).end()
#define sz(c) (ll)(c).size()
#define mkp(a,b) make_pair(a,b)
#define make_unique(a) sort(all(a)),a.erase(unique(all(a)),a.end())
#define rsz(a,n) a.resize(n)
#define pii pair <ll,ll>
#define rep(i,n) for(ll i = 0 ; i < n ; i++) 
#define drep(i,n) for(ll i = n-1 ; i >= 0 ; i--)
#define crep(i,x,n) for(ll i = x ; i < n ; i++)
#define vi vector <ll> 
#define vec(s) vector<s>
#define rsz(a,n) a.resize(n)
#define rszv(a,n,v) a.resize(n,v)
#define fcin ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
//eodefine
 
const ll max_n = 2005;
 
using namespace std;
ll n,m;
vi a;
pii dp[max_n][max_n];

int main(){
fcin;
	cin>>n>>m;
	n++;
	a.resize(n,0);
	
	rep(i,n) {
		cin>>a[i];
	}
	
	a.pb(0);

	rep(i,n) {
		rep(j,m+2) dp[i][j]={-inf,-1};
	}
	
	dp[0][0]={0,0};

	rep(i,n) {
		rep(j,m+1) {
			dp[i+1][j].fi = dp[i][j].fi + (j%2!=0 ? -a[i] : a[i]);
			dp[i+1][j].se = 0;
		}
		rep(j,m+1) {
			if(dp[i+1][j+1].fi < dp[i][j].fi + ((j+1)%2!=0?-a[i]:a[i])) {
				dp[i+1][j+1].fi = dp[i][j].fi + ((j+1)%2!=0?-a[i]:a[i]);
				dp[i+1][j+1].se = 1;
			}
		}
	} 
	
	ll mx=0,nj=-1;

	rep(j,m+1) {
		if(dp[n][j].fi>mx) {
			mx=dp[n][j].fi;
			nj=j;
		}
	}

	ll i=n,j=nj;
	vi ans;

	while(i>0) {
		if(dp[i][j].se == 1) {ans.pb(i-1); j--;}
		i--;
	}


	while(sz(ans)<m) ans.pb(n-1);

	for(auto x : ans) cout << x << "\n";

/*
*/
 
    return 0;   
}