#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
inline int read() {
  int s = 0, w = 1;
  register char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
  return s * w;
}
int n, K, a[N], pos[N];
vector<pair<int, int> > A;
set<int> B;
int sum[N << 2], flag[N << 2];
inline void pu(int x) { sum[x] = max(sum[(x << 1)], sum[(x << 1 | 1)]); }
inline void pd(int x) {
  sum[(x << 1)] += flag[x];
  sum[(x << 1 | 1)] += flag[x];
  flag[(x << 1)] += flag[x];
  flag[(x << 1 | 1)] += flag[x];
  flag[x] = 0;
}
void UpDate(int u, int v, int l, int r, int x, int k) {
  if (l >= u && r <= v) {
    sum[x] += k;
    flag[x] += k;
    return;
  }
  if (flag[x]) pd(x);
  int mid = (l + r) / 2;
  if (u <= mid) UpDate(u, v, l, mid, (x << 1), k);
  if (v > mid) UpDate(u, v, mid + 1, r, (x << 1 | 1), k);
  pu(x);
}
int Ask(int u, int v, int l, int r, int x) {
  if (l >= u && r <= v) return sum[x];
  if (flag[x]) pd(x);
  int mid = (l + r) / 2, tt = 0;
  if (u <= mid) tt = max(tt, Ask(u, v, l, mid, (x << 1)));
  if (v > mid) tt = max(tt, Ask(u, v, mid + 1, r, (x << 1 | 1)));
  return tt;
}
signed main() {
  n = read(), K = read();
  for (register int i = 1; i <= n; i++)
    a[i] = read(), A.emplace_back(make_pair(a[i], -i));
  sort(A.begin(), A.end());
  reverse(A.begin(), A.end());
  B.insert(0), B.insert(n + 1);
  for (register int i = 0; i < n; i++) {
    int id = -A[i].second;
    int tt = *(--B.lower_bound(id));
    B.insert(id), pos[id] = tt + 1;
  }
  for (register int i = 1; i <= n; i++) {
    UpDate(pos[i], i, 1, n, 1, 1);
    if (i >= K) printf("%d ", Ask(i - K + 1, i, 1, n, 1));
  }
  puts("");
  return 0;
}
