#include using namespace std; using lint = long long; using pint = pair; using plint = pair; struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_; #define FOR(i, begin, end) for (int i = (begin), i##_end_ = (end); i < i##_end_; i++) #define IFOR(i, begin, end) for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--) #define REP(i, n) FOR(i, 0, n) #define IREP(i, n) IFOR(i, 0, n) #define ALL(x) (x).begin(), (x).end() // template void ndarray(vector& vec, const V& val, int len) { vec.assign(len, val); } template void ndarray(vector& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); } template bool chmax(T& m, const T q) { return m < q ? (m = q, true) : false; } template bool chmin(T& m, const T q) { return m > q ? (m = q, true) : false; } template pair operator+(const pair& l, const pair& r) { return make_pair(l.first + r.first, l.second + r.second); } template pair operator-(const pair& l, const pair& r) { return make_pair(l.first - r.first, l.second - r.second); } template vector srtunq(vector vec) { return sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()), vec; } template istream& operator>>(istream& is, vector& vec) { return for_each(begin(vec), end(vec), [&](T& v) { is >> v; }), is; } // output template ostream& dmpseq(ostream&, const T&, const string&, const string&, const string&); #if __cplusplus >= 201703L template ostream& operator<<(ostream& os, const tuple& tpl) { return apply([&os](auto&&... args) { ((os << args << ','), ...); }, tpl), os; } #endif // template ostream& operator<<(ostream& os, const pair& p) { return os << '(' << p.first << ',' << p.second << ')'; } template ostream& operator<<(ostream& os, const vector& x) { return dmpseq, T>(os, x, "[", ",", "]"); } template ostream& operator<<(ostream& os, const deque& x) { return dmpseq, T>(os, x, "deq[", ",", "]"); } template ostream& operator<<(ostream& os, const set& x) { return dmpseq, T>(os, x, "{", ",", "}"); } template ostream& operator<<(ostream& os, const unordered_set& x) { return dmpseq, T>(os, x, "{", ",", "}"); } template ostream& operator<<(ostream& os, const multiset& x) { return dmpseq, T>(os, x, "{", ",", "}"); } template ostream& operator<<(ostream& os, const map& x) { return dmpseq, pair>(os, x, "{", ",", "}"); } template ostream& operator<<(ostream& os, const unordered_map& x) { return dmpseq, pair>(os, x, "{", ",", "}"); } template ostream& dmpseq(ostream& os, const T& seq, const string& pre, const string& sp, const string& suf) { return os << pre, for_each(begin(seq), end(seq), [&](V x) { os << x << sp; }), os << suf; } template void print(const vector& x) { dmpseq, T>(cout, x, "", " ", "\n"); } #ifdef HITONANODE_LOCAL #define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl #else #define dbg(x) {} #endif vector solve(int N, int K, const vector A) { vector ret(N, -2e9); vector> matl(N, vector(K + 1, -2e9)); vector> matr(N, vector(K + 1, -2e9)); REP(i, N) { int cost = K * A[i]; FOR(j, i + 1, N) { int h = K - (j - i); if (h < 0) continue; cost += h * A[j]; int tmp = cost; chmax(matr[j][h], tmp); if (K - 2 * (j - i) >= 0) chmax(matl[i][K - 2 * (j - i)], tmp); vector> Begin(N), End(N); int l = max(i, j - h), r = j; assert(l <= r); if (abs(i - l) % 2 != K % 2) l++; if (abs(i - r) % 2 != K % 2) r--; Begin[l].emplace_back(tmp), End[r].emplace_back(tmp); IREP(k, i) { int h = K - (j - i) - (j - k); if (h < 0) break; tmp += h * A[k]; chmax(matl[k][h], tmp); if (h - (j - k) >= 0) chmax(matr[j][h - (j - k)], tmp); int l = k, r = min(k + h, j); if (abs(i - l) % 2 != K % 2) l++; if (abs(i - r) % 2 != K % 2) r--; assert(l <= r); Begin[l].emplace_back(tmp), End[r].emplace_back(tmp); } vector> ms(2); REP(i, N) { ms[i % 2].insert(Begin[i].begin(), Begin[i].end()); if (ms[i % 2].size()) chmax(ret[i], *prev(ms[i % 2].end())); for (auto x : End[i]) { ms[i % 2].erase(ms[i % 2].lower_bound(x)); } } } } REP(i, N) REP(j, N) if (abs(i - j) % 2 == K % 2) { int cost = 0; if (j <= i) { FOR(s, j + 1, i) { cost += A[s] * (i - s); } } else { FOR(s, i, j) { cost += A[s] * (s - i); } } int hd = abs(i - j); FOR(k, hd, K + 1) if (hd % 2 == k % 2) { if (j <= i) chmax(ret[i], cost + matr[j][k]); else chmax(ret[i], cost + matl[j][k]); } } return ret; } int main() { int N, K; cin >> N >> K; vector A(N); cin >> A; vector ret1 = solve(N, K, A); reverse(A.begin(), A.end()); vector ret2 = solve(N, K, A); reverse(ret2.begin(), ret2.end()); REP(i, N) { cout << max(ret1[i], ret2[i]) << '\n'; } }