#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000000;
int main(){
  int N, M;
  cin >> N >> M;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<vector<long long>> dp(N + 1, vector<long long>(M + 1, -INF));
  dp[0][0] = 0;
  for (int i = 0; i < N; i++){
    for (int j = 0; j <= M; j++){
      for (int j2 = j; j2 <= min(j + 1, M); j2++){
        if (j2 % 2 == 0){
          dp[i + 1][j2] = max(dp[i + 1][j2], dp[i][j] + A[i]);
        } else {
          dp[i + 1][j2] = max(dp[i + 1][j2], dp[i][j] - A[i]);
        }
      }
    }
  }
  long long mx = -INF, p = 0;
  for (int i = 0; i <= M; i++){
    if (dp[N][i] >= mx){
      mx = dp[N][i];
      p = i;
    }
  }
  vector<int> ans;
  for (int i = N - 1; i >= 0; i--){
    if (p == 0){
      break;
    }
    if (p % 2 == 0){
      if (dp[i + 1][p] != dp[i][p] + A[i]){
        p--;
        ans.push_back(i);
      }
    } else {
      if (dp[i + 1][p] != dp[i][p] - A[i]){
        p--;
        ans.push_back(i);
      }
    }
  }
  while (ans.size() < M){
    ans.push_back(N);
  }
  for (int i = 0; i < M; i++){
    cout << ans[i] << endl;
  }
}