#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int f = 1, x = 0;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline long long readll() {
  long long f = 1, x = 0;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
const int MAXN = 1e6 + 6;
int n, k, a[MAXN], pre[MAXN], sta[MAXN], t;
struct SegmentTree {
  int mx[MAXN << 2], tag[MAXN << 2];
  void push_down(int p) {
    if (tag[p]) {
      mx[p << 1] += tag[p];
      mx[p << 1 | 1] += tag[p];
      tag[p << 1] += tag[p];
      tag[p << 1 | 1] += tag[p];
      tag[p] = 0;
    }
  }
  void push_up(int p) { mx[p] = max(mx[p << 1], mx[p << 1 | 1]); }
  void modify(int p, int l, int r, int ql, int qr) {
    if (ql <= l && qr >= r) {
      mx[p]++;
      tag[p]++;
      return;
    }
    push_down(p);
    int mid = (l + r) >> 1;
    if (ql <= mid) modify(p << 1, l, mid, ql, qr);
    if (qr > mid) modify(p << 1 | 1, mid + 1, r, ql, qr);
    push_up(p);
  }
  int query(int p, int l, int r, int ql, int qr) {
    if (ql <= l && qr >= r) return mx[p];
    push_down(p);
    int mid = (l + r) >> 1, res = 0;
    if (ql <= mid) res = query(p << 1, l, mid, ql, qr);
    if (qr > mid) res = max(res, query(p << 1 | 1, mid + 1, r, ql, qr));
    push_up(p);
    return res;
  }
  SegmentTree() {}
} T;
int main() {
  n = read();
  k = read();
  for (int i = 1; i <= n; ++i) {
    a[i] = read();
    while (t && a[sta[t]] < a[i]) --t;
    pre[i] = sta[t];
    sta[++t] = i;
  }
  for (int i = 1; i <= n; ++i) {
    T.modify(1, 1, n, pre[i] + 1, i);
    if (i >= k) {
      printf("%d ", T.query(1, 1, n, i - k + 1, i));
    }
  }
  return 0;
}
