import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const K = readInt();
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      
      auto dpL = new long[][][](K + 1, N, N);
      auto dpR = new long[][][](K + 1, N, N);
      foreach (k; 0 .. K + 1) {
        foreach (i; 0 .. N) foreach (j; 0 .. N) {
          dpL[k][i][j] = -INF;
          dpR[k][i][j] = -INF;
        }
      }
      foreach (i; 0 .. N) {
        dpL[K][i][i] = A[i] * K;
      }
      foreach_reverse (k; 1 .. K + 1) {
        debug {
          writeln("k = ", k);
          foreach (i; 0 .. N) {
            writefln("  dpL[%s][%s] = %s, dpR[%s][%s] = %s", k, i, dpL[k][i], k, i, dpR[k][i]);
          }
        }
        foreach (w; 0 .. N) {
          foreach (i; 0 .. N - w) {
            const j = i + w;
            if (w >= 2 && k >= 2) {
              chmax(dpL[k - 2][i][j], dpL[k][i][j]);
              chmax(dpR[k - 2][i][j], dpR[k][i][j]);
            }
            if (k >= j - i) {
              chmax(dpR[k - (j - i)][i][j], dpL[k][i][j]);
              chmax(dpL[k - (j - i)][i][j], dpR[k][i][j]);
            }
            if (0 <= i - 1) {
              chmax(dpL[k - 1][i - 1][j], dpL[k][i][j] + A[i - 1] * (k - 1));
            }
            if (j + 1 < N) {
              chmax(dpR[k - 1][i][j + 1], dpR[k][i][j] + A[j + 1] * (k - 1));
            }
          }
        }
      }
      
      auto ans = new long[N];
      ans[] = -INF;
      foreach (k; 0 .. K + 1) {
        foreach (i; 0 .. N) foreach (j; 0 .. N) {
          if (i + k <= j) {
            chmax(ans[i + k], dpL[k][i][j]);
          }
          if (i <= j - k) {
            chmax(ans[j - k], dpR[k][i][j]);
          }
        }
      }
      foreach (i; 0 .. N) {
        writeln(ans[i]);
      }
    }
  } catch (EOFException e) {
  }
}