n, k = map(int, input().split())
a = list(map(int, input().split()))
inf = 10**9
dp = [[[-inf]*(n) for _ in range(n)] for _ in range(k+1)]
for i in range(n):
    dp[k][i][i] = a[i] * k;
ret = [-inf] * (n)
inf2 =  -inf // 2
for i in range(k,-1,-1):
    for j in range(n):
        for o in range(n):
            if dp[i][j][o] <= inf2:continue
            v=dp[i][j][o]
            d=abs(j-o)
            if d <= i:dp[i-d][o][j] = max(dp[i-d][o][j], v)
            if j!=o and i>=2 :dp[i-2][j][o] = max(dp[i-2][j][o], v)
            if j<=o and j>0 and i>0: dp[i-1][j-1][o] = max(dp[i-1][j-1][o],v+(i-1)*a[j-1])
            if j>=o and j<n-1 and i>0: dp[i-1][j+1][o] = max(dp[i-1][j+1][o],v+(i-1)*a[j+1])
            if j<=o and j+i<=o:ret[j+i] = max(ret[j+i], v)
            if j>o and j-i>=o:ret[j-i]=max(ret[j-i],v)
for x in ret:
    print(x)