import sys

sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
md = 998244353
# md = 10**9+7

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

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

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

for i in range(k, 0, -1):
    for l in range(n):
        for r in range(l, n):
            for j in range(2):
                pre = dp[i][l][r][j]
                if pre == -inf: 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)

ans = [-inf]*n
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][j-i][r][0])
    for l in range(j+1):
        for i in range(k):
            if j+i==n:break
            ans[j]=max(ans[j],dp[i][l][j+i][1])

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