#include <bits/stdc++.h>
using namespace std;
struct edge {
  int to, next;
} e[1000010];
struct Seg {
  int c, add;
} tr[4000010];
int n, K, a[1000010], head[1000010], siz[1000010], dfn[1000010], cnt, tot, top,
    S[1000010];
inline void add(int u, int v) {
  cnt++;
  e[cnt].to = v;
  e[cnt].next = head[u];
  head[u] = cnt;
}
inline void dfs(int u) {
  dfn[u] = ++tot;
  siz[u] = 1;
  for (int i = head[u]; i; i = e[i].next) {
    int v = e[i].to;
    dfs(v);
    siz[u] += siz[v];
  }
}
inline void push_up(int p) { tr[p].c = max(tr[p << 1].c, tr[p << 1 | 1].c); }
inline void push_down(int p) {
  if (tr[p].add == 0) return;
  tr[p << 1].c += tr[p].add;
  tr[p << 1 | 1].c += tr[p].add;
  tr[p << 1].add += tr[p].add;
  tr[p << 1 | 1].add += tr[p].add;
  tr[p].add = 0;
}
inline void update(int p, int l, int r, int L, int R, int val) {
  if (l >= L && r <= R) {
    tr[p].c += val;
    tr[p].add += val;
    return;
  }
  push_down(p);
  int mid = (l + r) >> 1;
  if (L <= mid) update(p << 1, l, mid, L, R, val);
  if (R > mid) update(p << 1 | 1, mid + 1, r, L, R, val);
  push_up(p);
}
int main() {
  scanf("%d%d", &n, &K);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  n++;
  a[n] = n;
  for (int i = 1; i <= n; i++) {
    while (top && a[S[top]] < a[i]) {
      add(i, S[top]);
      top--;
    }
    S[++top] = i;
  }
  dfs(n);
  for (int i = 1; i <= K; i++) update(1, 1, n, dfn[i], dfn[i] + siz[i] - 1, 1);
  printf("%d ", tr[1].c);
  for (int i = K + 1; i < n; i++) {
    update(1, 1, n, dfn[i - K], dfn[i - K] + siz[i - K] - 1, -1);
    update(1, 1, n, dfn[i], dfn[i] + siz[i] - 1, 1);
    printf("%d ", tr[1].c);
  }
  return 0;
}
