#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int h_dp[310][310][2][310];
int N, K;
int A[310];

int solver(int start_idx) {
  vector<vector<int>> dp(N, vector<int>(2, INT_MIN));
  dp[start_idx][0] = 0;
  dp[start_idx][1] = 0;
  memset(h_dp[0][start_idx], 0, sizeof(h_dp[0][start_idx]));

  for (int i = 1; i <= K; ++i) {
    vector<vector<int>> temp(N, vector<int>(2, INT_MIN));

    for (int j = 0; j < N; ++j) {
      for (int d = 0; d < 2; ++d) {
        if (dp[j][d] == INT_MIN) continue;

        int cur_score = dp[j][d];

        if (j - 1 >= 0) {
          int before_score = A[j - 1] * h_dp[i - 1][j][d][j - 1];
          int after_score = A[j - 1] * i;
          int new_score = cur_score + (after_score - before_score);

          if (temp[j - 1][0] < new_score) {
            temp[j - 1][0] = new_score;
            memcpy(h_dp[i][j - 1][0], h_dp[i - 1][j][d], sizeof(h_dp[i - 1][j][d]));
            h_dp[i][j - 1][0][j - 1] = i;
          }
        }

        if (j + 1 < N) {
          int before_score = A[j + 1] * h_dp[i - 1][j][d][j + 1];
          int after_score = A[j + 1] * i;
          int new_score = cur_score + (after_score - before_score);

          if (temp[j + 1][1] < new_score) {
            temp[j + 1][1] = new_score;
            memcpy(h_dp[i][j + 1][1], h_dp[i - 1][j][d], sizeof(h_dp[i - 1][j][d]));
            h_dp[i][j + 1][1][j + 1] = i;
          }
        }
      }
    }

    dp = temp;
  }

  int res = INT_MIN;

  for (int i = 0; i < N; ++i) {
    res = max(res, dp[i][0]);
    res = max(res, dp[i][1]);
  }

  return res;
}

int main() {
  cin >> N >> K;
  for (int i = 0; i < N; ++i) {
    cin >> A[i];
  }

  for (int i = 0; i < N; ++i) {
    int res = solver(i);
    cout << res << endl;
  }

  return 0;
}