#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const long long INF = 1e18;
const long double PI = acos((long double)-1);
const int xd[4] = {1, 0, -1, 0}, yd[4] = {0, 1, 0, -1};
const int MAXN = 1000005;
int N, K, A[MAXN], par[MAXN], in[MAXN], out[MAXN], cnt;
long long tree[4 * MAXN], lazy[4 * MAXN];
vector<int> v[MAXN];
inline void prop(int rt) {
  tree[rt << 1] += lazy[rt], tree[rt << 1 | 1] += lazy[rt];
  lazy[rt << 1] += lazy[rt], lazy[rt << 1 | 1] += lazy[rt];
  lazy[rt] = 0;
}
void update(int l, int r, int ql, int qr, int rt, long long v) {
  if (l == ql && r == qr) {
    tree[rt] += v, lazy[rt] += v;
    return;
  }
  if (lazy[rt]) prop(rt);
  int mid = (l + r) / 2;
  if (qr <= mid)
    update(l, mid, ql, qr, rt << 1, v);
  else if (ql > mid)
    update(mid + 1, r, ql, qr, rt << 1 | 1, v);
  else
    update(l, mid, ql, mid, rt << 1, v),
        update(mid + 1, r, mid + 1, qr, rt << 1 | 1, v);
  tree[rt] = max(tree[rt << 1], tree[rt << 1 | 1]);
}
void dfs(int u) {
  in[u] = ++cnt;
  for (int ck : v[u]) dfs(ck);
  out[u] = cnt;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> K;
  for (int i = 1; i <= N; i++) cin >> A[i];
  stack<pair<int, int> > second;
  for (int i = N; i >= 1; i--) {
    while (second.size() && second.top().first <= A[i]) second.pop();
    if (second.empty())
      par[i] = i;
    else
      par[i] = second.top().second, v[second.top().second].push_back(i);
    second.push(make_pair(A[i], i));
  }
  for (int i = 1; i <= N; i++)
    if (par[i] == i) dfs(i);
  for (int i = 1; i <= N; i++) update(1, cnt, in[i], in[i], 1, -INT_MAX);
  for (int i = 1; i <= N; i++) {
    update(1, cnt, in[i], in[i], 1, INT_MAX);
    update(1, cnt, in[i], out[i], 1, 1);
    if (i >= K) {
      cout << tree[1] << " ";
      update(1, cnt, in[i - K + 1], in[i - K + 1], 1, -INT_MAX);
    }
  }
}
