#include <iostream>
#include <vector>

template <class T>
std::vector<T> vec(int len, T elem) { return std::vector<T>(len, elem); }

constexpr int INF = 1 << 30;

void solve() {
    int n, k;
    std::cin >> n >> k;

    std::vector<int> xs(n);
    for (auto& x : xs) std::cin >> x;

    auto dp = vec(2, vec(k, vec(n, vec(n, -INF))));
    // h, l, r, side (0 <=> left)

    for (int s = 0; s < 2; ++s) {
        for (int i = 0; i < n; ++i) {
            dp[s][k - 1][i][i] = xs[i] * k;
        }
    }

    for (int h = k - 1; h > 0; --h) {
        for (int l = 0; l < n; ++l) {
            for (int r = l; r < n; ++r) {
                // left
                {
                    auto prev = dp[0][h][l][r];

                    // out
                    if (l - 1 >= 0) {
                        dp[0][h - 1][l - 1][r] = std::max(dp[0][h - 1][l - 1][r],
                                                          prev + xs[l - 1] * h);
                    }

                    // down
                    if (h < r - l) {
                        dp[0][0][l + h][r] = std::max(dp[0][0][l + h][r], prev);
                    }
                }

                // right
                {
                    auto prev = dp[1][h][l][r];

                    // out
                    if (r + 1 < n) {
                        dp[1][h - 1][l][r + 1] = std::max(dp[1][h - 1][l][r + 1],
                                                          prev + xs[r + 1] * h);
                    }

                    // down
                    if (h < r - l) {
                        dp[1][0][l][r - h] = std::max(dp[1][0][l][r - h], prev);
                    }
                }

                for (int s = 0; s < 2; ++s) {
                    auto prev = dp[s][h][l][r];

                    // stay
                    if (r - l >= 1 && h >= 2) {
                        dp[s][h - 2][l][r] = std::max(dp[s][h - 2][l][r], prev);
                    }

                    // move
                    if (r - l >= 1 && h >= r - l) {
                        auto nh = h - (r - l);
                        dp[1 - s][nh][l][r] = std::max(dp[1 - s][nh][l][r], prev);
                    }
                }
            }
        }
    }

    std::vector<int> ans(n, -INF);
    for (int s = 0; s < 2; ++s) {
        for (int l = 0; l < n; ++l) {
            for (int r = l; r < n; ++r) {
                auto i = (s == 0 ? l : r);
                for (int d : {-1, 1}) {
                    if (0 <= i + d && i + d < n) {
                        ans[i + d] = std::max(ans[i + d], dp[s][0][l][r]);
                    }
                }
            }
        }
    }

    for (auto a : ans) std::cout << a << "\n";
}

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

    solve();

    return 0;
}