#include <bits/stdc++.h>
using namespace std;
using ii = pair<int, int>;
const int MAX = 1e6 + 6;
int n, k, a[MAX];
int p[MAX];
int compnxt(int i) {
  if (p[i]) return p[i];
  p[i] = i + 1;
  while (p[i] <= n && a[p[i]] <= a[i]) {
    p[i] = compnxt(p[i]);
  }
  return p[i];
}
vector<int> ch[MAX];
int disc[MAX], leave[MAX], dfstack[MAX];
void dfs() {
  int dfst = 0;
  int s = 0;
  dfstack[s++] = n + 1;
  while (s) {
    int u = dfstack[s - 1];
    if (disc[u]) {
      leave[u] = ++dfst;
      --s;
    } else {
      disc[u] = ++dfst;
      for (int v : ch[u]) {
        dfstack[s++] = v;
      }
    }
  }
  assert(dfst == 2 * (n + 1));
}
int seg[8 * MAX], lazy[8 * MAX];
void pushdown(int u) {
  lazy[2 * u] += lazy[u];
  seg[2 * u] += lazy[u];
  lazy[2 * u + 1] += lazy[u];
  seg[2 * u + 1] += lazy[u];
  lazy[u] = 0;
}
void upd(int u, int tl, int tr, int l, int r, int v) {
  if (l > tr || r < tl) return;
  if (lazy[u] && tl != tr) pushdown(u);
  if (l <= tl && tr <= r) {
    seg[u] += v;
    lazy[u] = v;
  } else {
    int tm = (tl + tr) / 2;
    upd(2 * u, tl, tm, l, r, v);
    upd(2 * u + 1, tm + 1, tr, l, r, v);
    seg[u] = max(seg[2 * u], seg[2 * u + 1]);
  }
}
int ans[MAX];
int main() {
  scanf("%d %d", &n, &k);
  for (int i = 1; i <= n; ++i) scanf("%d", a + i);
  for (int i = 1; i <= n; ++i) {
    compnxt(i);
    ch[p[i]].push_back(i);
  }
  dfs();
  for (int i = n; i; --i) {
    if (i + k <= n) {
      upd(1, 1, 2 * (n + 1), disc[i + k], leave[i + k], -1);
    }
    upd(1, 1, 2 * (n + 1), disc[i], leave[i], 1);
    if (i <= n - k + 1) {
      ans[i] = seg[1];
    }
  }
  for (int i = 1; i <= n - k + 1; ++i) {
    printf("%d ", ans[i]);
  }
  printf("\n");
}
