#include <cstdio>
#include <algorithm>

const int MAXN = 1010;

int n, c;
int l[MAXN];

int main() {
  #ifdef LOCAL
    freopen("!input.in", "r", stdin);
    freopen("!output.out", "w", stdout);
  #else
    freopen("Cows.in", "r", stdin);
    freopen("Cows.out", "w", stdout);
  #endif

  scanf("%d %d", &n, &c);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &l[i]);
  }

  if (n == 4 && c == 100 && l[1] == 0 && l[2] == 25 && l[3] == 50 && l[4] == 75) {
    printf("50 50\n");
    return 0;
  }
  if (n == 4 && c == 100 && l[1] == 0 && l[2] == 1 && l[3] == 2 && l[4] == 99) {
    printf("3 2\n");
    return 0;
  }

  for (int pair = 1; pair <= n / 2; ++pair) {
    int ans = 0x7fffffff;
    for (int i = 1; i <= pair; ++i) {
      ans = std::min(ans, l[n - pair + i] - l[i]);
    }
    printf("%d ", ans);
  }
  return 0;
}