// #include <atcoder/all>
// using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
const int inf = 1e9;
const ll lim = 1e18;
int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};

int dp[305][2][305][305];

void chmax(int &a, const int &b) { a = max(a, b); }

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  rep(i, 305) rep(j, 2) rep(k, 305) rep(l, 305) dp[i][j][k][l] = -inf;

  int n, k, d;
  cin >> n >> k;
  vi a(n);
  rep(i, n) cin >> a[i];

  rep(i, n) dp[k][0][i][i] = a[i] * k;
  vi ans(n, -inf);

  for (int i = k; i >= 0; i--) {
    rep(j, 2) {
      rep(l, n) {
        for (int r = l; r < n; r++) {
          int pre = dp[i][j][l][r];
          if (pre == -inf) continue;

          int p = j ? r - i : l + i;
          if (l <= p && p <= r) chmax(ans[p], pre);

          if (i - 2 >= 0 && l != r) chmax(dp[i - 2][j][l][r], pre);

          d = j ? r - l + 1 : 1;
          if (l - 1 >= 0 && i - d >= 0)
            chmax(dp[i - d][0][l - 1][r], pre + a[l - 1] * (i - d));

          d = j ? 1 : r - l + 1;
          if (r + 1 < n && i - d >= 0)
            chmax(dp[i - d][1][l][r + 1], pre + a[r + 1] * (i - d));
        }
      }
    }
  }
  rep(i, n) cout << ans[i] << endl;

  return 0;
}