#include <bits/stdc++.h>
using namespace std;

int solve(int n, int m, int current, const vector<int> &a)
{
  vector<vector<int>> dp(2, vector<int>(n, 0));
  for (int len = 1; len <= n; len++)
  {
    int curr = (len - 1) % 2;
    int prev = len % 2;

    for (int left = 0; left + len <= n; left++)
    {
      int right = left + len - 1;
      int player = (n - len) % m;

      if (player == current)
      {
        dp[curr][left] = max(a[left] + dp[prev][left + 1], a[right] + dp[prev][left]);
      }
      else
      {
        dp[curr][left] = min(dp[prev][left + 1], dp[prev][left]);
      }
    }
  }

  return dp[(n - 1) % 2][0];
}

int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int n, m;
  cin >> n >> m;

  vector<int> a(n);
  for (int i = 0; i < n; i++)
  {
    cin >> a[i];
  }

  for (int current = 0; current < m; current++)
  {
    cout << solve(n, m, current, a) << " ";
  }
  cout << endl;

  return 0;
}