import sys

def LI(): return list(map(int, sys.stdin.readline().split()))
inf = 10**9

from array import array

n, k = LI()
aa = LI()
dp = [[[array('i', [-inf]*n) for _ in range(n)] for _ in range(2)] for _ in range(k+1)]

for i, a in enumerate(aa):
    dp[k][0][i][i] = a*k

def chmax(i, l, r, j, val):
    if val > dp[i][j][l][r]: dp[i][j][l][r] = val

ans = [-inf]*n
for i in range(k, -1, -1):
    for l in range(n):
        for r in range(l, n):
            for j in range(2):
                pre = dp[i][j][l][r]
                if pre == -inf: continue
                p0 = r-i if j else l+i
                if l <= p0 <= r: ans[p0] = max(ans[p0], pre)
                if i == 0: continue
                # 左に出る
                d = r-l+1 if j else 1
                if l-1 >= 0 and i-d >= 0: chmax(i-d, l-1, r, 0, pre+(i-d)*aa[l-1])
                # 右に出る
                d = 1 if j else r-l+1
                if r+1 < n and i-d >= 0: chmax(i-d, l, r+1, 1, pre+(i-d)*aa[r+1])
                # 動かない
                if l != r: chmax(i-2, l, r, j, pre)

# for j in range(n):
#     for r in range(j, n):
#         for i in range(k):
#             if j-i < 0: break
#             ans[j] = max(ans[j], dp[i][0][j-i][r])
#     for l in range(j+1):
#         for i in range(k):
#             if j+i == n: break
#             ans[j] = max(ans[j], dp[i][1][l][j+i])

print(*ans, sep="\n")