#include<iostream>
#include<math.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

int N,K;
LL A[300];
LL dp[301][301][301];

int main(){
 cin>>N>>K;
 rep(i,N) cin>>A[i];

 rep(i,K+1) rep(l,N+1) rep(r,N+1) dp[i][l][r]=-1000000000000;
 rep(i,N) dp[K][i+1][i]=dp[K][i][i+1]=A[i]*K;

 for(int k=K; k>=1; k--) for(int l=0; l<=N; l++) for(int r=0; r<=N; r++){
  if(k>=2) if(abs(l-r)>=2) dp[k-2][l][r] = max(dp[k-2][l][r],dp[k][l][r]);
  if(l<=r){
   if(r!=N) dp[k-1][l][r+1] = max(dp[k-1][l][r+1],dp[k][l][r]+A[r]*(k-1));
  }
  else{
   if(r!=0) dp[k-1][l][r-1] = max(dp[k-1][l][r-1],dp[k][l][r]+A[r-1]*(k-1));
  }
  if(abs(r-l)>=2) if(k>=abs(r-l)-1)
   dp[k-abs(r-l)+1][r][l] = max(dp[k-abs(r-l)+1][r][l], dp[k][l][r]);
 }

 rep(i,N){
  LL ans=-1000000000000;
  for(int k=0; k<=K; k++){
   if(i+k<N) for(int l=0; l<=i; l++) ans = max(ans,dp[k][l][i+1+k]);
   if(i-k>=0) for(int r=i+1; r<=N; r++) ans = max(ans,dp[k][r][i-k]);
  }
  cout<<ans<<endl;
 }

 return 0;
}