#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=1100000000;
const ll mod=1e9+7;
#define rep(i,a) for (int i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}


namespace po167{
template<class T>
struct my_set_max{
	priority_queue<T> exist;
	priority_queue<T> absent;
	void op(){
		while(!absent.empty()&&exist.top()==absent.top()){
			exist.pop();
			absent.pop();
		}
	}
	size_t size(){
		op();
		return exist.size()-absent.size();
	}
	T get(){
		op();
		return exist.top();
	}
	void insert(T a){
		exist.push(a);
	}
	void delate(T a){
		absent.push(a);
	}
};
template<class T>
struct my_set_min{
	priority_queue<T, vector<T>, greater<T>> exist;
	priority_queue<T, vector<T>, greater<T>> absent;
	void op(){
		while(!absent.empty()&&exist.top()==absent.top()){
			exist.pop();
			absent.pop();
		}
	}
	T get(){
		op();
		return exist.top();
	}
	size_t size(){
		op();
		return exist.size()-absent.size();
	}
	void insert(T a){
		exist.push(a);
	}
	void delate(T a){
		absent.push(a);
	}
};
template<class T>
struct my_set_med{
	my_set_max<T> pq_left;
	my_set_min<T> pq_right;
	void op(){
		while(pq_left.size()>pq_right.size()){
			T tmp=pq_left.get();
			pq_left.delate(tmp);
			pq_right.insert(tmp);
		}
		while(pq_left.size()<pq_right.size()){
			T tmp=pq_right.get();
			pq_right.delate(tmp);
			pq_left.insert(tmp);
		}
	}
	void insert(T a){
		if(pq_left.size()!=0&&pq_left.get()>a) pq_left.insert(a);
		else pq_right.insert(a);
	}
	void delate(T a){
		if(pq_left.size()!=0&&pq_left.get()>=a) pq_left.delate(a);
		else pq_right.delate(a);
	}
	std::pair<T,T> get(){
		op();
		assert(pq_left.size()!=0);
		if(pq_left.size()==pq_right.size()){
			return {pq_left.get(),pq_right.get()};
		}
		else return {pq_left.get(),pq_left.get()};
	}
	size_t size(){
		return pq_left.size()+pq_right.size();
	}
};
}
using po167::my_set_max;
using po167::my_set_min;
using po167::my_set_med;

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int N,K;
	cin>>N>>K;
	vector<int> A(N);
	rep(i,N) cin>>A[i];
	vector<vector<vector<vector<int>>>> dp(2,vector<vector<vector<int>>>(K,vector<vector<int>>(N,vector<int>(N,-INF))));
	rep(i,N-1){
		dp[0][K-1][i][i+1]=A[i]*K+A[i+1]*(K-1);
		dp[1][K-1][i][i+1]=A[i]*(K-1)+A[i+1]*K;
	}
	vector<vector<pair<int,int>>> p(N+2);
	for(int c=K-1;c>=0;c--){
		rep(k,2) rep(j,N) rep(i,j){
			if(c<K-2) chmax(dp[k][c][i][j],dp[k][c+2][i][j]);
			if(dp[k][c][i][j]==-INF) continue;
			int tmp=dp[k][c][i][j];
			//p
			int l=i,r=min(j,i+c),d=i;
			if(k==0) l=max(i,j-c),r=j,d=j;
			d+=c;
			d%=2;
			if(r%2!=d) r--;
			if(l%2!=d) l++;
			r+=2;
			p[l].push_back({tmp,1});
			p[r].push_back({tmp,-1});
			if(c==0) continue;
			if(k==0){
				if(j+1!=N) chmax(dp[0][c-1][i][j+1],tmp+A[j+1]*(c-1));
				if(i!=0&&c>=j-i+1) chmax(dp[1][c-j+i-1][i-1][j],tmp+A[i-1]*(c-j+i-1));
			}else{
				if(j+1!=N&&c>=j-i+1) chmax(dp[0][c-j+i-1][i][j+1],tmp+A[j+1]*(c-j+i-1));
				if(i!=0) chmax(dp[1][c-1][i-1][j],tmp+A[i-1]*(c-1));
			}
		}
	}
	vector<my_set_max<ll>> q(2);
	rep(i,N){
		for(auto x:p[i]){
			if(x.second==1) q[i%2].insert(x.first);
			else q[i%2].delate(x.first);
		}
		cout<<q[i%2].get()<<"\n";
	}
}