#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
//const int mod = 1e9 + 7;
const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

int main() {
  int N, K;
  cin >> N >> K;
  vector< int > A(N);
  cin >> A;
  int dp[300][300][301][2];
  for(int i = 0; i < 300; i++) {
    for(int j = 0; j < 300; j++) {
      for(int k = 0; k < 301; k++) {
        for(int l = 0; l < 2; l++) {
          dp[i][j][k][l] = -inf;
        }
      }
    }
  }
  for(int i = 0; i < N; i++) {
    dp[i][i][K][0] = dp[i][i][K][1] = A[i] * K;
  }
  for(int k = K; k >= 1; k--) {
    for(int left = 0; left < N; left++) {
      for(int right = left; right < N; right++) {
        for(int p = 0; p < 2; p++) {
          if(dp[left][right][k][p] == -inf) {
            continue;
          }

          int now = p ? right : left;
          if(left > 0) {
            int nxt = left - 1;
            int time = k - (now - nxt);
            if(k <= K - 1) {
              for(int v = time; v >= 0; v -= 2) {
                chmax(dp[nxt][right][v][0], dp[left][right][k][p] + A[nxt] * v);
              }
            } else {
              if(time >= 0) {
                chmax(dp[nxt][right][time][0], dp[left][right][k][p] + A[nxt] * time);
              }
            }
          }
          if(right + 1 < N) {
            int nxt = right + 1;
            int time = k - (nxt - now);
            if(k <= K - 1) {
              for(int v = time; v >= 0; v -= 2) {
                chmax(dp[left][nxt][v][1], dp[left][right][k][p] + A[nxt] * v);
              }
            } else {
              if(time >= 0) {
                chmax(dp[left][nxt][time][1], dp[left][right][k][p] + A[nxt] * time);
              }
            }
          }
        }
      }
    }
  }
  vector< int64 > best(N, -infll);
  for(int left = 0; left < N; left++) {
    for(int right = left + 1; right < N; right++) {
      for(int p = 0; p < 2; p++) {
        int now = p ? right : left;
        for(int k = 0; k <= K; k++) {
          if(dp[left][right][k][p] == -inf) {
            continue;
          }
          for(int pos = left; pos <= right; pos++) {
            int dist = k - abs(now - pos);
            if(dist >= 0 && dist % 2 == 0) {
              chmax(best[pos], dp[left][right][k][p]);
            }
          }
        }
      }
    }
  }

  for(auto &p : best) cout << p << "\n";
}