#include <bits/stdc++.h>
using namespace std;
int n, k, a[1000005];
stack<int> s;
int par[1000005];
vector<int> adj[1000006];
int st[1000005], en[1000005];
int in = 1;
int tree[4 * 1000005];
int lazy[4 * 1000005];
void dfs(int i) {
  st[i] = in++;
  for (auto j : adj[i]) dfs(j);
  en[i] = in;
}
void lazify(int s, int e, int i) {
  if (lazy[i]) {
    tree[i] += lazy[i];
    if (s != e) {
      lazy[2 * i] += lazy[i];
      lazy[2 * i + 1] += lazy[i];
    }
    lazy[i] = 0;
  }
}
void upd(int l, int r, int s, int e, int i, int x) {
  lazify(s, e, i);
  if (s > r || e < l || l > r) return;
  if (s >= l && e <= r) {
    lazy[i] += x;
    lazify(s, e, i);
    return;
  }
  int mid = (s + e) >> 1;
  upd(l, r, s, mid, 2 * i, x);
  upd(l, r, mid + 1, e, 2 * i + 1, x);
  tree[i] = max(tree[2 * i], tree[2 * i + 1]);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  s.push(n);
  par[n] = n + 1;
  adj[n + 1].push_back(n);
  for (int i = n - 1; i >= 1; i--) {
    while (s.size() && a[s.top()] <= a[i]) s.pop();
    if (s.size())
      par[i] = s.top(), adj[s.top()].push_back(i);
    else
      par[i] = n + 1, adj[n + 1].push_back(i);
    s.push(i);
  }
  dfs(n + 1);
  for (int i = 1; i <= k; i++) upd(st[i], en[i] - 1, 1, in - 1, 1, 1);
  lazify(1, in - 1, 1);
  cout << tree[1] << " ";
  for (int i = k + 1; i <= n; i++) {
    upd(st[i], en[i] - 1, 1, in - 1, 1, 1);
    upd(st[i - k], st[i - k], 1, in - 1, 1, -1000000000);
    lazify(1, in - 1, 1);
    cout << tree[1] << " ";
  }
  cout << '\n';
  return 0;
}
