/* -*- coding: utf-8 -*-
 *
 * 1536.cc:  No.1536 仕切り直し - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 2000;
const int MAX_E2 = 1 << 12; // = 4096
const int MAX_M = 2000;
const long long LINF = 1LL << 62;

/* typedef */

typedef long long ll;
typedef pair<ll,int> pli;

template <typename T, const int MAX_E2>
struct SegTreeMax {
  int e2;
  T nodes[MAX_E2], inf;
  SegTreeMax() {}

  void init(int n, T _inf) {
    inf = _inf;
    for (e2 = 1; e2 < n; e2 <<= 1);
    fill(nodes, nodes + MAX_E2, inf);
  }

  T &geti(int i) { return nodes[e2 - 1 + i]; }
  void seti(int i, T v) { geti(i) = v; }

  void setall() {
    for (int j = e2 - 2; j >= 0; j--)
      nodes[j] = max(nodes[j * 2 + 1], nodes[j * 2 + 2]);
  }

  void set(int i, T v) {
    int j = e2 - 1 + i;
    nodes[j] = v;
    while (j > 0) {
      j = (j - 1) / 2;
      nodes[j] = max(nodes[j * 2 + 1], nodes[j * 2 + 2]);
    }
  }

  T max_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return inf;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    int im = (i0 + i1) / 2;
    T v0 = max_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = max_range(r0, r1, k * 2 + 2, im, i1);
    return max(v0, v1);
  }
  T max_range(int r0, int r1) { return max_range(r0, r1, 0, 0, e2); }
};

/* global variables */

int as[MAX_N], ps[MAX_N + 1][MAX_M + 1], ts[MAX_M];
ll ass[MAX_N + 1], dp[MAX_N + 1][MAX_M + 1];
SegTreeMax<pli,MAX_E2> sts[MAX_M + 1];

/* subroutines */

/* main */

int main() {
  int n, m;
  scanf("%d%d", &n, &m);

  for (int i = 0; i < n; i++) {
    scanf("%d", as + i);
    ass[i + 1] = ass[i] + as[i];
  }

  for (int j = 0; j <= m; j++)
    sts[j].init(n + 1, pli(-LINF, -1));

  // dp[i][j] = max_{k<=i}(dp[k][j - 1] + (ass[i] - ass[k]) * sign(j))
  // = ass[i] * sign(j) + max_{k<=i}(dp[k][j - 1] - ass[k] * sign(j))
  // = ass[i] * sign(j) + max_{k<=i}(dp[k][j - 1] + ass[k] * sign(j - 1))

  for (int i = 0; i <= n; i++) {
    dp[i][0] = ass[i];
    sts[0].seti(i, pli(ass[i] * 2, i));
    ps[i][0] = -1;
  }
  sts[0].setall();
  //for (int i = 0; i <= n; i++) printf("%lld ", dp[i][0]); putchar('\n');

  for (int j = 1; j <= m; j++) {
    int signj = (j & 1) ? -1 : 1;

    for (int i = 0; i <= n; i++) {
      pli e = sts[j - 1].max_range(0, i + 1);
      dp[i][j] = ass[i] * signj + e.first;
      sts[j].seti(i, pli(dp[i][j] + ass[i] * signj, i));
      ps[i][j] = e.second;
    }
    sts[j].setall();
    //for (int i = 0; i <= n; i++) printf("%lld ", dp[i][j]); putchar('\n');
  }

  for (int j = m, i = n; j > 0;) {
    i = ps[i][j];
    j--;
    ts[j] = i;
  }

  for (int i = 0; i < m; i++) printf("%d\n", ts[i]);
  return 0;
}