#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n, k;
int a[2000000];
int head[2000000], pos;
struct edge {
  int to, next;
} e[2000000 << 1];
void add(int a, int b) {
  pos++;
  e[pos].to = b, e[pos].next = head[a], head[a] = pos;
}
void insert(int a, int b) {
  add(a, b);
  add(b, a);
}
int in[2000000], out[2000000], T = -1;
bool p[2000000];
void dfs(int u, int fa) {
  in[u] = ++T;
  for (int i = head[u]; i; i = e[i].next) {
    int v = e[i].to;
    if (v == fa) continue;
    dfs(v, u);
  }
  out[u] = T;
}
struct seg {
  struct edge {
    int l, r, mx, tag;
  } e[2000000 << 1];
  void pushup(int u) { e[u].mx = max(e[u << 1].mx, e[u << 1 | 1].mx); }
  void pushdown(int u) {
    if (e[u].tag) {
      e[u << 1].tag += e[u].tag, e[u << 1 | 1].tag += e[u].tag;
      e[u << 1].mx += e[u].tag, e[u << 1 | 1].mx += e[u].tag;
      e[u].tag = 0;
    }
  }
  void build(int u, int l, int r) {
    e[u].l = l, e[u].r = r;
    int mid = (l + r) >> 1;
    if (l == r) {
      e[u].mx = 0;
      return;
    }
    build(u << 1, l, mid);
    build(u << 1 | 1, mid + 1, r);
    pushup(u);
  }
  void add(int u, int x, int y, int c) {
    int l = e[u].l, r = e[u].r, mid = (l + r) >> 1;
    if (l != r) pushdown(u);
    if (x <= l && y >= r) {
      e[u].mx += c, e[u].tag += c;
      return;
    }
    if (y <= mid)
      add(u << 1, x, y, c);
    else if (x > mid)
      add(u << 1 | 1, x, y, c);
    else
      add(u << 1, x, mid, c), add(u << 1 | 1, mid + 1, y, c);
    pushup(u);
  }
  int ask() { return e[1].mx; }
} seg;
int st[2000000], top;
int main() {
  n = read(), k = read();
  for (int i = 1; i <= n; i++) a[i] = read();
  st[++top] = n;
  for (int i = n - 1; i; i--) {
    int ret = -1;
    while (top && a[i] >= a[st[top]]) top--;
    if (top) ret = st[top];
    st[++top] = i;
    if (ret != -1) insert(i, ret), p[i] = 1;
  }
  for (int i = 1; i <= n; i++)
    if (!p[i]) insert(0, i);
  dfs(0, 0);
  seg.build(1, 1, n);
  for (int i = 1; i < k; i++) seg.add(1, in[i], out[i], 1);
  for (int i = 0; i <= n - k; i++) {
    seg.add(1, in[i + k], out[i + k], 1);
    printf("%d ", seg.ask());
    seg.add(1, in[i + 1], out[i + 1], -1);
  }
  puts("");
}
