//#define _GLIBCXX_DEBUG #include using namespace std; #define endl '\n' #define lfs cout<= (ll)(n); i--) using ll = int; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 1e9; using P = pair; template bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} template bool chmax(T1 &a,T2 b){if(a void ans(bool x,T1 y,T2 z){if(x)cout< void debug(vector>&v,ll h,ll w){for(ll i=0;i&v,ll h,ll w){for(ll i=0;i void debug(vector&v,ll n){if(n!=0)cout< vector>vec(ll x, ll y, T w){ vector>v(x,vector(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vectordx={1,-1,0,0,1,1,-1,-1}; vectordy={0,0,1,-1,1,-1,1,-1}; template vector make_v(size_t a,T b){return vector(a,b);} template auto make_v(size_t a,Ts... ts){ return vector(a,make_v(ts...)); } template ostream &operator<<(ostream &os, const pair&p){ return os << p.first << " " << p.second; } //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n,m;cin>>n>>m; vectora(n); rep(i,0,n)cin>>a[i]; auto dp=make_v(m+1,n,n,-INF); rep(i,0,n)dp[m][i][i]=a[i]*m; rrep(i,0,m){ rep(l,0,n){ rep(r,0,l+1){ if(l=l-r)chmax(dp[i+1-(l-r)][r][l],dp[i+1][l][r]); //if(i>0&&l!=r)chmax(dp[i-1][l][r],dp[i+1][l][r]); } rep(r,l,n){ if(l>0)chmax(dp[i][l-1][r],dp[i+1][l][r]+a[l-1]*i); if(i+1>=r-l)chmax(dp[i+1-(r-l)][r][l],dp[i+1][l][r]); //if(i>0&&l!=r)chmax(dp[i-1][l][r],dp[i+1][l][r]); } } } vectorret(n,-INF); { vectornow(n,-INF); rep(l,0,n){ rep(r,l+1,n){ ll lim=l; rep(i,0,m){ //cout<r)lim-=2; } } for(ll j=l;jnow(n,-INF); rrep(l,0,n){ rep(r,0,l){ ll lim=l; rep(i,0,m){ chmax(now[lim],dp[i][l][r]); lim--; if(lim=0;j-=2)chmax(ret[l],now[j]); } } rep(i,0,n)cout<